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

所谓的Happy数字，就是给一个正数s， 然后计算它每一个位上的平方和，得到它的下一个数， 然后下一个数继续及选每位上的平方和……如果一直算下去，没有出现过之前有出现过的数字而出现了1， 那么恭喜，这就是个Happy Number.

使用哈希表判断是否陷入了没有1的循环。

class Solution {
public:
    
    int calculate(int n)
    {
        int squared_sum = 0;
        while(n)
        {
            int tmp = n%10;
            squared_sum += tmp * tmp;
            n/=10;
        }
        return squared_sum;
    }
    bool isHappy(int n) 
    {
        bool isHappyNum = false;
        unordered_set<int> mySet;
        while(true)
        {
            //the final num is 1
            if(n == 1)
            {
                isHappyNum = true;
                break;
            }
            
            //a number appears more than once,indicating that falling into a loop with out 1
            if(mySet.find(n) != mySet.end())
            {
                isHappyNum = false;
                break;
            }
            
            mySet.insert(n);
            //calculate the squared sum of every single digit in n
            n = calculate(n);
        }
        
        return isHappyNum;
        
    }
};