-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20_Valid_Parentheses.swift
71 lines (55 loc) · 1.52 KB
/
20_Valid_Parentheses.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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*
Done: 31.05.2024. Revisited: N/A
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
1. Open brackets must be closed by the same type of brackets.
2. Open brackets must be closed in the correct order.
3. Every close bracket has a corresponding open bracket of the same type.
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "()[]{}"
Output: true
Example 3:
Input: s = "(]"
Output: false
Constraints:
1 <= s.length <= 10^4
s consists of parentheses only '()[]{}'.
*/
import Foundation
class P20 {
class CharStack {
private var stack: [Character]
init() {
stack = []
}
func push(_ val: Character) {
stack.append(val)
}
func pop() -> Character? {
stack.removeLast()
}
func top() -> Character? {
return stack.last
}
}
// MARK: - Option 1. NC. Time: O(n). Memory: O(n)
func isValid(_ s: String) -> Bool {
let stack = CharStack()
let closeToOpen: [Character: Character] = [")": "(", "}": "{", "]": "["]
for char in s {
if closeToOpen.values.contains(char) {
stack.push(char)
} else {
if stack.top() == closeToOpen[char] {
_ = stack.pop()
} else {
return false
}
}
}
return stack.top() == nil
}
}