99：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

解析：我们可以通过在哈希集合中存储过往的数来检查是否发生重复

代码如下：

// 需要用到哈希表来记录过往的数字以检查是否发生重复
class Solution {
public:
        bool isHappy(int n) {
                unordered_set<set> num;
                while (true) {
                        num.insert(n);
                        int sum = 0;
                        for ( ; n; n /= 10) {
                                int tmp = n < 10 ? n : n % 10;
                                sum += tmp * tmp;
                        }
                        if (sum == 1) return true;
                        n = sum;
                        if (num.find(n) != num.end()) return false;
                }
        }
};