-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhappyNumbers.py
More file actions
41 lines (32 loc) · 985 Bytes
/
Copy pathhappyNumbers.py
File metadata and controls
41 lines (32 loc) · 985 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
'''
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:
Input: 19
Output: true
Explanation:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1
'''
class Solution(object):
def isHappy(self, n):
"""
:type n: int
:rtype: bool
"""
s = set()
while n!= 1:
if n in s:
return False
s.add(n)
n = self.calculateSquare(n)
return True
def calculateSquare(self, n):
res = 0
while n:
v = n % 10
res += v * v
n = n/10
return res