LeetCode 397. Integer Replacement

最新推荐文章于 2022-10-10 10:20:34 发布

David_DLUT

最新推荐文章于 2022-10-10 10:20:34 发布

阅读量321

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/David_DLUT/article/details/53941661

版权

LeetCode 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

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) {
        unsigned m = n;
        int k = 0;
        while(m != 1) {
            if (m == 3) {
                k += 2;
                break;
            }
            else if ((m & 1) == 0) {
                m /= 2;
            }
            else if ((m & 3) == 3) {
                m += 1;
            }
            else {
                m -= 1;
            }
            ++k;
        }
        return k;
    }
};