[LeetCode] 2413. Smallest Even Multiple - python

Hyunji·2022년 12월 8일
0

알고리즘

목록 보기
51/51
post-thumbnail

문제 설명

Given a positive integer n, return the smallest positive integer that is a multiple of both 2 and n.

Example 1:

Input: n = 5
Output: 10
Explanation: The smallest multiple of both 5 and 2 is 10.

Example 2:

Input: n = 6
Output: 6
Explanation: The smallest multiple of both 6 and 2 is 6. Note that a number is a multiple of itself.

Constraints:

1 <= n <= 150

풀이방법

class Solution:
    def smallestEvenMultiple(self, n: int) -> int:
        if n % 2 == 0:
            return n
        else:
            return n * 2

LeetCode. 2413. Smallest Even Mulitple

profile
성장중인 개발자

0개의 댓글