[LeetCode]202. Happy Number

最新推荐文章于 2024-11-08 23:27:36 发布

非技术流

最新推荐文章于 2024-11-08 23:27:36 发布

阅读量448

点赞数

文章标签： leetcode python

本文链接：https://blog.csdn.net/myself9711/article/details/45865767

版权

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

Solution: create a num_set to add repeated sum, if the sum is in this num_set, return False, else return true.

Time Complexity: O(n^2)

class Solution:
    # @param {integer} n
    # @return {boolean}
    def isHappy(self, n):
        num_set = set()
        while n != 1 and n not in num_set:
            num_set.add(n)
            sum = 0
            while n:
                digit = n % 10
                sum += digit * digit
                n /= 10
            n = sum
        return n == 1