1611. Minimum One Bit Operations to Make Integers Zero.txt

https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/

class Solution {
public:
    int minimumOneBitOperations(int n) {
        if (n == 0)
            return 0;
        if ((n & (n - 1)) == 0)
            return n * 2 - 1;
        int i;
        for (i = 0; (1 << (i + 1)) <= n; ++i)
            ;
        return 1 + minimumOneBitOperations((n ^ (1 << (i - 1))) & ~(1 << i)) + minimumOneBitOperations(1 << (i - 1));
    }
};