forked from iamshubhamg/Leet-Code
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathhappynumber.py
More file actions
35 lines (30 loc) · 986 Bytes
/
happynumber.py
File metadata and controls
35 lines (30 loc) · 986 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
The Problem was : 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.
Example:
Input: 19
Output: true
Explanation:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1
My Solution :
class Solution:
def isHappy(self, n: int) -> bool:
s = set()
square = 0
while square != 1:
square = 0
while n > 0:
square += (n % 10) ** 2
n = n//10
if square in s:
return False
else:
n = square
if n < 243:
s.add(n)
if (a=b)
return True