leetcode

0 class Solution {

1 public:

2 int minimumOneBitOperations(int n) const {

3 bitset<32> res, num(n);

4 res[31] = num[31];

5 for (int i = 30; i >= 0; i--) {

6 res[i] = res[i + 1] ^ num[i];

7 }

8 return res.to_ulong();

9 }

10 };