原題鏈接 https://leetcode.com/problems/happy-number/
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
class Solution {
public:
bool isHappy(int n) {
unordered_map<int, bool>vis;
while (n != 1)
{
vis[n] = true;
n = getSs(n);
if (vis[n])return false;
}
return true;
}
int getSs(int x)
{
int sum = 0;
while (x)
{
int t = x % 10;
sum += t*t;
x /= 10;
}
return sum;
}
};