题目:
Write an algorithm to determine if a number is "happy".
A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.
Example: 19 is a happy number
- 12 + 92 = 82
- 82 + 22 = 68
- 62 + 82 = 100
- 12 + 02 + 02 = 1
解答:
开始想了很长时间,会不会有什么数据的规律性之类的……结果我想多了,正常模拟然后用 map 保证没有陷入到循环之中就好了。
</pre></div><pre name="code" class="cpp">class Solution {
public:
int sumDigit(int n)
{
int ans = 0;
while(n > 0)
{
ans += (n % 10) * (n % 10);
n = n / 10;
}
return ans;
}
bool isHappy(int n) {
unordered_map<int, int> circle;
int tmp = n;
while(circle.find(tmp) == circle.end())
{
circle[tmp] = 1;
if(tmp==1) return true;
else tmp = sumDigit(tmp);
}
return false;
}
};