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

• 1² + 9² = 82
• 8² + 2² = 68
• 6² + 8² = 100
• 1² + 0² + 0² = 1

从例子我们可以看出来，将每个位上的数平方相加，终止的条件：平方和等于1，或者平方和重复出现。用递归的解决方案如下。

class Solution {

private:
    int total;
    unordered_set<int> record;
public:
    Solution()
    {
        total = 0;
        record.clear();
    }
    
    bool isHappy(int n) {
        while(n)
        {
            total += (n % 10) * (n % 10);
            n /= 10;
        }
        if(1 == total)
            return true;
        else if(record.count(total))
            return false;
        else
        {
            record.insert(total);
            int temp = total;
            total = 0;
            return isHappy(temp);
        }
    }
};