题目:
Given a positive integer n and you can do operations as follow:
- If n is even, replace n with
n/2
. - If n is odd, you can replace n with either
n + 1
orn - 1
.
What is the minimum number of replacements needed for n to become 1?
Example 1:
Input: 8 Output: 3 Explanation: 8 -> 4 -> 2 -> 1
Example 2:
Input: 7 Output: 4 Explanation: 7 -> 8 -> 4 -> 2 -> 1 or 7 -> 6 -> 3 -> 2 -> 1
思路:
这道题目有两点需要注意:
1)n如果是奇数,则n的计算结果不仅取决于n-1,而且取决于n+1,因此用动态规划就有点麻烦。所以DFS+Memorization就是一个更好的解决方案:我们维护一个哈希表,用来记录已经计算出来的结果。当碰到一个数需要计算时,首先查表,看看是否已经被计算了,如果是则直接返回;否则才开始计算。
2)由于n+1有可能在整数范围内溢出,所以我们在递归的过程中最好将数据类型提升为long long。
代码:
class Solution {
public:
int integerReplacement(int n) {
return integerReplacement(static_cast<long long>(n));
}
private:
int integerReplacement(long long n) {
if (hash.count(n) > 0) {
return hash[n];
}
if (n == 1) {
hash[1] = 0;
return 0;
}
if (n % 2 == 0) {
hash[n] = integerReplacement(n / 2) + 1;
}
else {
int ret1 = integerReplacement(n + 1) + 1;
int ret2 = integerReplacement(n - 1) + 1;
hash[n] = min(ret1, ret2);
}
return hash[n];
}
unordered_map<long long, int> hash;
};