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

总结

思路一：
使用hash，每次计算出新的值判断hash表中是否存在
代码：

class Solution:
    def isHappy(self, n):
        """
        :type n: int
        :rtype: bool
        """
        all = set()
        next = n

        while next not in all:
            all.add(next)
            next = 0
            while n > 0:
                next += (n % 10) ** 2
                n = n // 10
            if next == 1:
                return True
            n = next
        return False

思路二：
这个问题的可以看作求是否寻在环路，可以用找链表中循环相同，使用两个指针，一个步长为2，一个步长为1。具体方法可参考之前的链表循环问题

int digitSquareSum(int n) {
    int sum = 0, tmp;
    while (n) {
        tmp = n % 10;
        sum += tmp * tmp;
        n /= 10;
    }
    return sum;
}

bool isHappy(int n) {
    int slow, fast;
    slow = fast = n;
    do {
        slow = digitSquareSum(slow);
        fast = digitSquareSum(fast);
        fast = digitSquareSum(fast);
    } while(slow != fast);
    if (slow == 1) return 1;
    else return 0;
}

思路三：
数学方法，不做介绍