leetcode

0 class Solution {

1 private:

2 unordered_map<int, int> visited;

3

4 public:

5 int integerReplacement(int n) {

6 if (n == 1) return 0;

7 if (visited.count(n)) return visited[n];

8

9 if (!(n & 1 == 1)) return visited[n] = 1 + integerReplacement(n / 2);

10 return visited[n] = 2 + min(integerReplacement(n / 2), integerReplacement(n / 2 + 1));

11 }

12 };