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: 19 is a happy number

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

问题很简单，唯一的难点就是如何判断endless loop，第一种方案是将出现的数都记录下来，每次判断的时候从记录里边找，如果找到了，说明肯定是个环，就不会是happy number。

第二种方案不需要记录，判断是否有环的情况原理也很简单，考虑两个人在操场上跑圈，跑得快的那个势必会追上跑得慢的那个人。这里也是一样，取一个跑得慢的指针，一个跑得慢的指针，什么时候两个值相等了，那肯定是有环了。