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:
Input: 19 Output: true Explanation: 12 + 92 = 82 82 + 22 = 68 62 + 82 = 100 12 + 02 + 02 = 1
方法1:题目中说了如果形成不了1,就会loop endlessly in a cycle,自己试验之后发现确实不是happy numbers 的数不停计算会重复之前的计算结果,所以就通过unordered_set记录所有的结果,如果重复了就说明不是happy number。
class Solution {
public:
bool isHappy(int n) {
unordered_set<int> vals;
while(n!=1&&vals.count(n)==0){
vals.insert(n);
int tp=0;
while(n/10!=0){
tp+=(n%10)*(n%10);
n=n/10;
}
tp+=n*n;
n=tp;
}
if(n==1)return true;
else return false;
}
};