-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path20.Valid Parentheses.cpp
More file actions
52 lines (44 loc) · 1.12 KB
/
20.Valid Parentheses.cpp
File metadata and controls
52 lines (44 loc) · 1.12 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
/*
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) {
vector<char> stack;
int j = 0;
while(j < s.length()){
if(s[j] == '(' || s[j] == '{' || s[j] == '['){
stack.push_back(s[j]);
}
else if(stack.size() != 0 && (s[j] == ')' && stack.back() == '(' || s[j] == '}' && stack.back() == '{' || s[j] == ']' && stack.back() == '[')){
stack.pop_back();
}
else
return false;
++j;
}
if(stack.size() == 0)
return true;
else
return false;
}
};