-
Notifications
You must be signed in to change notification settings - Fork 0
/
0202_Happy_Number.py
43 lines (38 loc) · 1.22 KB
/
0202_Happy_Number.py
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
42
43
'''
202. Happy Number
Write an algorithm to determine if a number n 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.
Return True if n is a happy number, and False if not.
Input: 19
Output: true
Explanation:
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1
'''
class Solution:
''' Approach #1 (Hash Table) '''
'''
Maintain a Hash of already occurred values if the value get repeated again return False
As there will be a cycle for that value
'''
def isHappy(self, n: int) -> bool:
Hash = dict()
while(n!=1):
if(n in Hash):return False
Hash[n] = True
temp = n
n = 0
while(temp):
rem = temp%10
n += rem*rem
temp //=10
return True
if __name__ == '__main__':
sol = Solution()
n = 19
print(sol.isHappy(n))