题目:
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
题意:
写一个程序来判断一个数字是否是“happy”的。
所谓 happy number,是被这样的过程定义的数字:初始时有一个正整数,用该整数每位数字的平方之和代替这个整数,重复该过程直至数字变为1(之后不再变化),否则陷入一个无尽的循环但该循环不包括1。那些能终止于1的数字就称为 happy number。
代码:
class Solution(object):
def isHappy(self, n):
"""
:type n: int
:rtype: bool
"""
if n <= 0 :
return False
else :
sumy = list() #存储各个数字的平方和
while 1 :
lis = list() #存储n的各个数字
while n/10 > 0 : #分解n的各个数字
lis.append(n%10)
n = n/10
lis.append(n)
result = 0 #计算各个数字的平方和
for i in range(len(lis)) :
result = result + lis[i]**2
if result in sumy : #如果这个和之前出现过,即出现了循环,则不是happy数
return False
else :
if result == 1 : #如果和为1,则为happy数
return True
sumy.append(result) #否则,无法判断是否为happy数,将和存入list中,重新对n赋值,重新计算
n = result