forked from luliyucoordinate/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0020.cpp
37 lines (36 loc) · 876 Bytes
/
0020.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
#include <iostream>
#include <string>
#include <unordered_map>
#include <stack>
using namespace std;
static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
class Solution
{
public:
bool isValid(string s)
{
stack<char> mystack;
unordered_map<char, char> match = {{'(',')'}, {'{','}'}, {'[',']'}};
for (auto& i : s)
{
if (i == '(' || i == '{' || i == '[')
{
mystack.push(i);
}
else
{
if (mystack.empty()) return false;
char top = mystack.top();
mystack.pop();
if (match[top] != i) return false;
}
}
return mystack.size() == 0;
}
};
int main()
{
string str = "()";
cout << Solution().isValid(str) << endl;
return 0;
}