Py3 C++導出遞迴公式解難題Leetcode1611 Minimum One Bit Operations to Make Integer...

Py3 C++導出遞迴公式解難題Leetcode1611  Minimum One Bit Operations to Make Integers Zero從導出公式到寫出code，一次完成解Leetcode難題

[C++一行解請進]

----

From deriving the formula to writing the code, solve a LeetCode problem in one go.

[Codes on Leetcode]https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/solutions/7333696/recursion-iterationbeats-100-by-anwenden-qflm/

class Solution {
public:
    int minimumOneBitOperations(int n) {
        return (n==0)? 0: ((1<<(32-countl_zero(unsigned(n))))-1-minimumOneBitOperations(n^bit_floor(unsigned(n))));
    }
};