202. Happy Number

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: 19 is a happy number

• 12 + 92 = 82
• 82 + 22 = 68
• 62 + 82 = 100
• 12 + 02 + 02 = 1

开始的时候没有搞清楚题意，以为出现cycle的意思是会回到第一个integer，eg回到19，而真正的题意是会出现之前出现的某一个数。

最终代码为：

class Solution {
public:
    bool isHappy(int n) {
        int new_n= 0;
        int first = n;
        unordered_set<int> s;
        s.insert(n);
        while(1) {
            while(n) {
                int digit = n % 10;
                new_n += digit * digit;
                n = n /10;
            }
            if (new_n == 1) return true;//only when all digits of n are added to new_n then can compare whether it's 1
            if (s.find(new_n) != s.end()) return false;
            s.insert(new_n);// don't forget to update set
            n = new_n;
            new_n = 0;//don't forget to update new_n
        }
    }
};

细节问题：

1 首先用while（1）因为题中提到会一直循环

2 记住只有当n的所有位的平方都加入new_n时才能判断是否为1，否则n=16时，n最后会等于1，只是因为n的最高位为一，而不是循环回了1

3 记得要更新new_n 回到0，不然new_n里存的是所有以前的n的digit的平方的总和，而不是当前n

4 记得更新set