LeetCode2413. Smallest Even Multiple

叶卡捷琳堡

于 2024-01-02 00:12:38 发布

阅读量446

点赞数 7

文章标签：算法数据结构 leetcode c++

本文链接：https://blog.csdn.net/weixin_46841376/article/details/135331000

版权

本文介绍了一个编程题目，要求找出给定正整数n的最小正整数倍数，该数同时能被2和n整除。给出了一个简单的C++类Solution实现，利用模运算判断条件并返回结果。

摘要由CSDN通过智能技术生成

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

class Solution {
public:
    int smallestEvenMultiple(int n) {
        return n % 2 == 0 ? n : n * 2;
    }
};

关注