C++ Solution 💻| Easy 😊| Explained🤔 | 100% Faster 🚀
Intuition\nIn this problem, the goal is to find the smallest even multiple of a given integer n. The smallest even multiple of any number is either the number i
# Intuition\nIn this problem, the goal is to find the smallest even multiple of a given integer `n`. The smallest even multiple of any number is either the number itself (if it\u2019s even) or twice the number (if it\u2019s odd). This insight simplifies the problem as we only need to check whether `n` is even or odd.\n\n# Approach\n1. Check if the given integer `n` is even by evaluating `n % 2 == 0`.\n    - If `n` is even, then `n` is already the smallest even multiple.\n    - If `n` is odd, the smallest even multiple will be `n * 2`.\n2. Return the value based on the condition above.\n\n# Complexity\n- Time complexity: **O(1)**  \n  The solution involves only a single conditional check and multiplication in the worst case, both of which take constant time.\n\n- Space complexity: **O(1)**  \n  The solution requires no extra space beyond a single integer return value.\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int smallestEvenMultiple(int n) {\n        if(n%2 == 0)\n            return n;\n        return n*2;\n    }\n};\n```
['C++']