-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path202_Happy_Number.swift
More file actions
100 lines (78 loc) · 2.32 KB
/
202_Happy_Number.swift
File metadata and controls
100 lines (78 loc) · 2.32 KB
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
/*
Done 13.09.2025. Revisited: N/A
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.
- 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.
Return true if n is a happy number, and false if not.
Example 1:
Input: n = 19
Output: true
Explanation:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1
Example 2:
Input: n = 2
Output: false
Constraints:
1 <= n <= 2^31 - 1
https://www.youtube.com/watch?v=ljz85bxOYJ0
*/
import Foundation
class P202 {
// MARK: - Option 1 (my). Time: O(?). Memory: O(?)
func calculateSum(_ n: Int) -> Int {
var sum: Decimal = 0
let numbers = String(n)
for numStr in numbers {
guard let num = Int(String(numStr)) else { continue }
let value = pow(Decimal(num), 2)
sum += value
}
return NSDecimalNumber(decimal: sum).intValue
}
func isHappy(_ n: Int) -> Bool {
var map: [Int: Int] = [:]
var nextNum = n
while true {
let sum = calculateSum(nextNum)
if sum == 1 {
return true
}
if map[nextNum] != nil {
// Got same number twice = we're in the endless loop
return false
} else {
map[nextNum] = sum
nextNum = sum
}
}
}
// MARK: - Option 2. Time: O(?). Memory: O(n) (Better Solution - Linked List Cycle)
func isHappy2(_ n: Int) -> Bool {
var visit = Set<Int>()
var nextN = n
while !visit.contains(nextN) {
visit.insert(nextN)
nextN = calculateSum2(nextN)
if nextN == 1 {
return true
}
}
return false
}
func calculateSum2(_ n: Int) -> Int {
var output = 0
var num = n
while num > 0 {
var digit = num % 10
digit = NSDecimalNumber(decimal: pow(Decimal(num), 2)).intValue
output += digit
num = num / 10
}
return output
}
}