g2401_2500.s2413_smallest_even_multiple.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g2401_2500.s2413_smallest_even_multiple;

// #Easy #Math #Number_Theory #2022_11_15_Time_0_ms_(100.00%)_Space_40.9_MB_(48.99%)

/**
 * 2413 - Smallest Even Multiple\.
 *
 * Easy
 *
 * 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`
**/
public class Solution {
    public int smallestEvenMultiple(int n) {
        return n % 2 == 0 ? n : n * 2;
    }
}