forked from sachuverma/DataStructures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathValid Parentheses.cpp
63 lines (53 loc) · 1.08 KB
/
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
/*
Valid Parentheses
=================
Given a string s 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.
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "()[]{}"
Output: true
Example 3:
Input: s = "(]"
Output: false
Example 4:
Input: s = "([)]"
Output: false
Example 5:
Input: s = "{[]}"
Output: true
Constraints:
1 <= s.length <= 104
s consists of parentheses only '()[]{}'.
*/
class Solution
{
public:
bool isValid(string s)
{
stack<char> st;
for (auto &i : s)
{
if (i == '(' || i == '{' || i == '[')
st.push(i);
else
{
if (!st.size())
return false;
if (i == ')' && st.top() == '(')
st.pop();
else if (i == '}' && st.top() == '{')
st.pop();
else if (i == ']' && st.top() == '[')
st.pop();
else
return false;
}
}
return st.size() == 0;
}
};