LeetCode 202. Happy Number

描述

解决

class Solution {
public:
bool isHappy(int n) {
map<int, int> m;
bool flag = false;
if (n == 1)
return true;
m
= 1;
int sum = n;
while (sum != 1)
{
int t = 0;
while (sum)
{
t += (sum % 10) * (sum % 10);
sum /= 10;
}
++m[t];
if (m[t] == 2)
{
flag = true;
break;
}
sum = t;
// cout << sum << endl;
}
if (flag)
return false;
else
return true;
}
};