concise recursive solution


  • 0
    B
        unsigned integerReplacement(unsigned n) {
            if (n == 1) return 0;
            else if (n % 2 == 0) {
                return integerReplacement(n / 2) + 1;
            } else return min(integerReplacement(n + 1), integerReplacement(n - 1)) + 1;
        }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.