[leetcode] Happy Number

简单题，模拟并记录即可~代码如下：

bool isHappy(int n) {
        unordered_set<int> appear;
        while(n != 1){
            appear.insert(n);
            int tmp = n;
            n = 0;
            while(tmp){
                n += (int)pow(tmp%10, 2);
                tmp /= 10;
            }
            if(appear.find(n) != appear.end())
                return false;
        }
        if(n == 1)
            return true;
        return false;
    }