leetcode 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
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100

12 + 02 + 02 =
1

class Solution(object):

def gao(self , n):
reslut = int(0)
while n > 0 :
m = n % 10
reslut += m * m
n = int(n/10)
return reslut

def isHappy(self, n):
_hash = {}
_hash
= True
while True:
n = self.gao(n)
if n == 1:
return  True
if _hash.get(n):
return  False
_hash
= True

if __name__ == '__main__':
s = Solution()
print(s.isHappy(19))