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
一个数如果按以上规则能达到1,则是happy的; 那么什么情况下不能达到呢?那就必须无环状。
<span style="font-size:14px;">class Solution {
public:
bool isHappy(int n) {
map<int, int> temp;
while(n != 1)
{
if(temp.find(n) == temp.end())
temp[n] = 1;
else
return false;
stack<int> temp;
while(n)
{
temp.push(n%10);
n = n /10;
}
while(temp.size() != 0)
{
n = n+ temp.top()*temp.top();
temp.pop();
}
}
return true;
}
};</span>