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
Credits:
Special thanks to @mithmatt and @ts for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
思路:
首先0为False,1为True
判断n是否出现过,如果出现过,则直接返回False
当n=1时候,返回True
其他情况按部就班地计算就好了~
class Solution(object):
def isHappy(self, n):
if n<1:
return False
elif n==1:
return True
hashtable={}
while n!=1:
if n in hashtable:
return False
else:
hashtable.setdefault(n,None)
array=[]
while n:
array.append((n%10)**2)
n=n/10
n=sum(array)
return True