397. Integer Replacement

最新推荐文章于 2024-07-20 22:34:59 发布

zg1g

最新推荐文章于 2024-07-20 22:34:59 发布

阅读量494

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode bit intergar

本文链接：https://blog.csdn.net/daigualu/article/details/72861851

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

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

代码实现

Following coding refers to
A couple of Java solutions with explanations
But it has a bug of overflowing and I fix it.

    public int IntegerReplacement(int n) {
        int cnt = 0;
        long bign = (long)n; //n = Int32.MaxValue(2147483647),adds 1 and would overflow
        while (bign != 1) {
        if ((bign & 1) == 0) { //even number
            bign >>= 1;
          } 
          //It is enough to examine the last two digits to figure out 
          //whether incrementing or decrementing will give more 1's. Indeed, 
          //if a number ends with 01, 
          //then certainly decrementing is the way to go. Otherwise, if it ends with 11, 
          //then certainly incrementing is at least as good as decrementing (*011 -> *010 / *100) or
          // even better (if there are three or more 1's).
          else if (bign == 3|| ((bign >> 1) & 1) == 0) { //*01
            --bign;
          }
          else { //*11
            ++bign;
        }
        ++cnt;
       } 
       return cnt;
    }