Leetcode 397. Integer Replacement (Easy) (cpp)

最新推荐文章于 2023-07-31 22:39:29 发布

Niko_Ke

最新推荐文章于 2023-07-31 22:39:29 发布

阅读量576

点赞数

分类专栏： Leetcode C++ C++ Leetcode Math 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52629871

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Math

40 篇文章 0 订阅

订阅专栏

Leetcode 397. Integer Replacement (Easy) (cpp)

Tag: Math

Difficulty: Easy

/*

397. Integer Replacement (Easy)

Given a positive integer n and you can do operations as follow:

If n is even, replace n with n/2.
If n is odd, you can replace n with either n + 1 or n - 1.
What is the minimum number of replacements needed for n to become 1?

Example 1:

Input:
8

Output:
3

Explanation:
8 -> 4 -> 2 -> 1
Example 2:

Input:
7

Output:
4

Explanation:
7 -> 8 -> 4 -> 2 -> 1
or
7 -> 6 -> 3 -> 2 -> 1

*/
class Solution {
public:
    int integerReplacement(int n) {
        int res = 0;
        unsigned m = n;
        while (m > 3) {
            //...?0 even
            if (!(m & 1)) m >>= 1;
            //...11
            else if (m & 2) m++;
            //...01
            else m--;
            res++;
        }
        return res + m - 1;
    }
};