Leetcode 397. Integer Replacement (Easy) (cpp)

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:8Output:3Explanation:8 -> 4 -> 2 -> 1Example 2:Input:7Output:4Explanation:7 -> 8 -> 4 -> 2 -> 1or7 -> 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;    }};