题目:
一道很简单的题,关键是,但不是快乐树会陷入死循环要怎么判断:
方法是,若同一个和出现第二次则是陷入了死循环
class Solution(object):
def isHappy(self, n):
"""
:type n: int
:rtype: bool
"""
def get_digit_square_sum(n):
digit_sum = 0
while n != 0:
digit_sum += (n % 10) ** 2
n = n // 10
return digit_sum
sum_set = set()
while n not in sum_set and n != 1:
sum_set.add(n)
n = get_digit_square_sum(n)
if n == 1:
return True
else:
return False