leetcode202. 快乐数
解题重点:
1.将快乐数问题映射成链表判断是否为环问题
2.然后我们只需要封装一个指定算法函数,就能够当作next方法来使用,就更加形象映射问题
class Solution:
def get_next(self,number):
num_sum = 0
while number > 0:
number , a = divmod(number,10)
num_sum += a ** 2
return num_sum
def isHappy(self, n: int) -> bool:
slow = n
fast = self.get_next(n)
while fast != 1 and fast != slow:
slow = self.get_next(slow)
fast = self.get_next(self.get_next(fast))
return fast == 1