202. 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

My code:

class Solution(object):    def isHappy(self, n):        """        :type n: int        :rtype: bool        """        result = []        tempResult = n        while tempResult!=1 :            tempN = tempResult            tempResult =0            while  tempN>0:                tempResult +=(tempN%10)**2                 tempN /=10            if tempResult in result:                return False            result.append(tempResult)        return True

Floyd Cycle

Reference