20170306-leetcode-202-Happy Number

最新推荐文章于 2022-09-27 11:08:40 发布

u010105243

最新推荐文章于 2022-09-27 11:08:40 发布

阅读量318

点赞数

分类专栏： LeetCode Python编程文章标签：算法

本文链接：https://blog.csdn.net/u010105243/article/details/60603983

版权

Python编程同时被 2 个专栏收录

45 篇文章 0 订阅

订阅专栏

LeetCode

36 篇文章 0 订阅

订阅专栏

1.Description

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

1² + 9² = 82
8² + 2² = 68
6² + 8² = 100
1² + 0² + 0² = 1
https://leetcode.com/problems/happy-number/?tab=Description

解读
给定任何一个正整数，计算每位数上的平方，求和，并不断重复计算，如果有1出现，则为happyNumber，否则会进入一个循环；所有不快乐数的数位平方和计算，最後都会进入 4 → 16 → 37 → 58 → 89 → 145 → 42 → 20 → 4 的循环中。
http://baike.baidu.com/link?url=Xc-p5vE0DPUwPkbEj7qeOjTlVSY3TLq-fCUEs-t3gBLQ9DjEWpajg55YCtTP539DABsp6coRd_GCzggVRwA79hsm8dxy4cbIYo3tiGyw8KLXAP6PX-XRio8BfmdbeWc8NZkJKA51b0FMhL7KiYZOjtdA1BTBcbFgc4JZSDcSIxK

2.Solution

class Solution(object):
    def isHappy(self, n):
        """
        :type n: int
        :rtype: bool
        """

        stack = []
        n=self.caculate(n)
        stack.append(n)
        while 1:
            n=self.caculate(n)
            if n==1:return True
            else:
                if n in stack:return False
                else:
                    stack.append(n)
    def caculate(self,n):
        return sum([int(x)**2 for x in str(n)])

把计算的记过存放在一个stack中，如果中间结果又有1的直接返回true，如果中间结果等于stack中的某一个值，那么返回false

class Solution(object):
    def isHappy(self, n):
        n=self.caculate(n)
        while 1:
            n=self.caculate(n)
            if n==1:return True
            if n==4:return False
    def caculate(self,n):
        return sum([int(x)**2 for x in str(n)])