No Need for GCD
Intuition\n Describe your first thoughts on how to solve this problem. \nWe are asked to return the smallest even multiple. Most people would use GCD, but we ju
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nWe are asked to return the smallest even multiple. Most people would use GCD, but we just need to know if it\'s odd.\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n1. To check if the number is odd, we can use the modulo % operation.\n``` Python3 []\nif n % 2 == 1:\n    pass\n```\n\n2. If the number is odd, return `n * 2`.\n``` Python3 []\nif n % 2 == 1:\n    return n * 2\n```\n\n3. If the number is not odd, return `n`.\n``` Python3 []\nif n % 2 == 1:\n    return n * 2\n\nreturn n\n```\n\nThere you have it! We solved this problem without having to use GCD.\n\n# Complexity\n- Time complexity: $$O(1)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n``` Python3 []\nclass Solution:\n    def smallestEvenMultiple(self, n: int) -> int:\n        if n % 2 == 1:\n            return n * 2\n\n        return n\n```
['Python3']