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 number，只需要判断在计算下一个数的时候是否产生循环，比如某一次生成了82，在之后不断的生成过程中又一次生成了82，这就产生循环了，这个数也就不是happy number。因此简单的办法就是用一个集合记录下生成的数，之后查表。
方法一：

class Solution {
public:
    bool isHappy(int n) {
        set<int> m;

        while(n != 1)
        {
            m.insert(n);
            n = getNext(n);
            if(m.find(n) != m.end())
            {
                return false;
            }
        }
        return true;

    }

    int getNext(int n)
    {
        int next = 0;
        while(n)
        {
            int t = n % 10;
            next += t*t;
            n = n / 10;
        }
        return next;
    }
};

方法二：使用表记录下来将会带来一定的空间复杂度。有一种更巧妙的方法，将每个生成的数形成一个链表，检测这个链表里是否有重复的数，就变成链表的回环检测的问题,回环检测问题，当然是快慢指针啦。

class Solution {
public:
    bool isHappy(int n) {
        int slow, fast;
        slow = fast = n;

        while(slow != 1 || fast != 1)
        {
            slow = getNext(slow);
            fast = getNext(fast);
            fast = getNext(fast);
            if(slow == fast && slow != 1)
                return false;
        }
        return true;

    }

    int getNext(int n)
    {
        int next = 0;
        while(n)
        {
            int t = n % 10;
            next += t*t;
            n = n / 10;
        }
        return next;
    }
};