-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20. Valid Parentheses.cpp
64 lines (51 loc) · 1.3 KB
/
20. Valid Parentheses.cpp
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
/*
Link: https://leetcode.com/problems/valid-parentheses/
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Note that an empty string is also considered valid.
Example 1:
Input: "()"
Output: true
Example 2:
Input: "()[]{}"
Output: true
Example 3:
Input: "(]"
Output: false
Example 4:
Input: "([)]"
Output: false
Example 5:
Input: "{[]}"
Output: true
*/
class Solution {
public:
bool isValid(string s) {
stack<int> st;
int i=0, j, n=s.size();
while (i < n) {
if (s[i] == '(' || s[i] == '[' || s[i] == '{') {
st.push(s[i]);
} else if (!st.empty()) {
if (s[i] == ')' && st.top() == '(') {
st.pop();
} else if(s[i] == ']' && st.top() == '[') {
st.pop();
} else if (s[i] == '}' && st.top() == '{') {
st.pop();
} else
return false;
} else
return false;
i++;
}
return st.empty();
}
};
/*
Time Complexity: O(n)
Space Complexity: O(n)
*/