202. Happy Number

最新推荐文章于 2021-12-02 14:08:01 发布

zoojing

最新推荐文章于 2021-12-02 14:08:01 发布

阅读量82

点赞数

分类专栏： leetcode python 文章标签： python leetcode

本文链接：https://blog.csdn.net/zoojing/article/details/50930016

版权

python 同时被 2 个专栏收录

60 篇文章 0 订阅

订阅专栏

leetcode

44 篇文章 0 订阅

订阅专栏

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

Python

class Solution(object):
def isHappy(self, n):
    """
    :type n: int
    :rtype: bool
    """
    if n <= 0:
        return False
    else:
        while n!= 0:
            n = self.square_add(n)
            if n == 1:
                return True
            elif n == 4:
                return False

def square_add(self, n):
    num = 0
    while n != 0:
        num += pow(n%10, 2)
        n = n // 10
    return num