https://leetcode.com/problems/integer-replacement/description/
class Solution {
public:
int integerReplacement(int n) {
if (n==1){
return 0;
}
if (n%2 == 0){
return 1+integerReplacement(n/2);
}else{
long long t = n;
return 2+min(integerReplacement((t+1)/2), integerReplacement((t-1)/2));
}
}
};
递归解