[LeetCode]202. 快乐数

202. 快乐数

class Solution {
public:
    bool isHappy(int n) {
        int now=n;
        bool appear[100005];
        memset(appear,false,sizeof(appear));
        while (now!=1){
            if (now!=n){
                if (appear[now]) break;
            }
            if (now!=n) appear[now]=true;
            int tot=0;
            while (now>0){
                int tip=now%10;
                tot+=tip*tip;
                now/=10;
            }
            now=tot;
            //appear[now]=true;
            //if (now==1) return true;
        }
        if (now==1) return true;
        return false;
    }
};