forked from soapyigu/LeetCode-Swift
-
Notifications
You must be signed in to change notification settings - Fork 1
/
CountAndSay.swift
48 lines (42 loc) · 1.3 KB
/
CountAndSay.swift
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
/**
* Question Link: https://leetcode.com/problems/count-and-say/
* Primary idea: Recursive iteration, use outer iteration to count times,
* use inner iteration to get the right string for specific index
*
* Note: Swift does not have a way to access a character in a string with O(1),
* thus we have to first transfer the string to a character array
* Time Complexity: O(n^2), Space Complexity: O(n)
*
*/
class CountAndSay {
func countAndSay(n: Int) -> String {
guard n > 0 else {
return ""
}
var res = "1"
var temp: String
var count: Int
var chars: [Character]
var current: Character
for _ in 1 ..< n{
temp = ""
count = 1
chars = [Character](res.characters)
current = chars[0]
for i in 1 ..< chars.count {
if chars[i] == current {
count += 1
} else {
temp.append(Character("\(count)"))
temp.append(current)
count = 1
current = chars[i]
}
}
temp.append(Character("\(count)"))
temp.append(current)
res = temp
}
return res
}
}