Description:
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
Solution:
class Solution {
/**
* @param Integer $n
* @return Integer
*/
function smallestEvenMultiple($n) {
$i = $n;
while(true){
if(($i%2) == 0 && ($i%$n) == 0 ) return $i;
$i++;
}
return -1;
}
}
Approach:
Identify the value of the variable i that satisfies both conditions:
i % 2 == 0: This means i is divisible by 2.
i % n == 0: This means i is also divisible by n.
Continue checking values of i until both conditions are true. Return the value of i when it satisfies both divisibility checks.
Complexity
Time complexity:
O(n)
Space complexity:
O(n)