Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g2401_2500.s2413_smallest_even_multiple.Solution

```
public class Solution
extends Object
```
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

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int smallestEvenMultiple(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

smallestEvenMultiple

public int smallestEvenMultiple(int n)