Leetcode刷题记录——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：

Input: 19
Output: true
Explanation: 
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

• 题目大意

给你一个整数，让你判断这个数是不是“happy”， happy数的定义是说，如果一个数将其每一位数的平方和再继续运算直到最后为1，则为happy数，如果中间其平方和出现相同的数字循环，则不为happy数。

• 解题思路

主体是将一个整数，求其每个位数的平方加起来的和，这个数再按这种规则继续运算下去，直至出现1或者出现之前已经求过的和，即产生循环，所以需要一个hash来保存每一次求得的平方和。

bool isHappy(int n) {
    unordered_set<int> old_integer;    /*保存历史平方和*/

    while( old_integer.find(n) == old_integer.end() )    /*如果历史未遇到n*/
    {    

        old_integer.insert(n);
        int sum = 0;

        while( n > 0 )
        {
            int d = n % 10;
            sum += d * d;
            n = n / 10; 
        }

        n = sum;        /*将求得的平方和作为n*/
    }
    return n == 1;
    
}