forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathisValid.cpp
More file actions
41 lines (38 loc) · 1.06 KB
/
isValid.cpp
File metadata and controls
41 lines (38 loc) · 1.06 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
#include <iostream>
#include <climits>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long LL;
class Solution {
public:
bool isValid(string s) {
stack<char> sk;
REP(i,s.length()) {
if (s[i] == '(' || s[i] == '[' || s[i] == '{') sk.push(s[i]);
else if (s[i] == ')') {
if (!sk.empty() && sk.top() == '(') sk.pop();
else return false;
} else if (s[i] == ']') {
if (!sk.empty() && sk.top() == '[') sk.pop();
else return false;
} else if (s[i] == '}') {
if (!sk.empty() && sk.top() == '{') sk.pop();
else return false;
}
}
return sk.empty();
}
};
int main() {
Solution s = Solution();
cout << s.isValid("()[]{}") << endl;
cout << s.isValid("([)]") << endl;
return 0;
}