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

---

LeetCode：链接

快乐数的定义过程如下：从任意一个正整数开始，将原数替换为其每一位的平方和，重复此过程直到数字=1（此时其值将不再变化），或者进入一个不包含1的无限循环。那些以1为过程终止的数字即为“快乐数”。

按照“happy number”的定义，直接循环计算各位平方和，观察是否收敛到1，若是则是 happy number。为了判断循环是否开始重复，要用一个字典（dict）或集合（set）来保存已经出现的数字，dict的效率更高。

“求一个数的所有数字的平方和”挺简单的：

sum = 0
while n:
    sum += (n % 10)**2
    n //= 10

代码：

class Solution(object):
    def isHappy(self, n):
        """
        :type n: int
        :rtype: bool
        """
        nums_dict = {}
        while True:
            nums_dict[n] = True
            sum = 0
            while n:
                sum += (n%10)*(n%10)
                n = n // 10

            if sum == 1:
                return True
            # 如果已经出现过 说明进入了循环
            elif sum in nums_dict:
                return False
            else:
                n = sum