Math-397-Integer Replacement

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

kevin聪

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

阅读量343

点赞数 1

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/79210048

版权

算法与数据结构同时被 2 个专栏收录

569 篇文章 0 订阅

订阅专栏

leetcode

557 篇文章 12 订阅

订阅专栏

Description:
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

Best Solution:

/*
*其实问题的根本就是如何使n/2的操作更多，让n更快变为1,假设n=xxx...01(二进制),那么-1会更快
*xxx...01->xxx...00->xxx...0->xxx...,而+1，xxx...01->xxx...10->xxx...1->xxx...,
*当n为xxx...11时显然就是+1更快了。不过有个例外，3=11,如果按照我们之前的想法，应该是
*11->100->10->1,而-1应该是11->10->1.
*/
class Solution {
    public int integerReplacement(int n) {
    int c = 0;
    while (n != 1) {
        if ((n & 1) == 0) {
            n >>>= 1;
        } else if (n == 3 || ((n >>> 1) & 1) == 0) {
            --n;
        } else {
            ++n;
        }
        ++c;
    }
    return c;
}
}