class Solution {
public:
//熟悉取一个数值上各位上的值
int getsum(int n ){
int sum = 0;
while (n){
sum = sum + ( (n % 10) * (n % 10) );
n = n / 10;
}
return sum;
}
bool isHappy(int n) {
unordered_set<int> result;
int sum = getsum(n);
while(result.find(sum) == result.end()){//在集合中找不到重复出现的数
result.insert(sum);
if (sum == 1){
return true;
}
sum = getsum(sum);
}
return false;
}
};