leetcode: 202. Happy Number
原题链接
class Solution {
public:
bool isHappy(int n) {
unordered_map<int, bool> mp;
while (n != 1) {
mp[n] = true;
int m = 0;
int tmp = n;
while (tmp != 0) {
m += (tmp % 10) * (tmp % 10);
tmp /= 10;
}
if (mp[m]) return false;
n = m;
}
return true;
}
};