-
Notifications
You must be signed in to change notification settings - Fork 2
/
20.cpp
86 lines (72 loc) · 1.86 KB
/
20.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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
// Author : Accagain
// Date : 17/2/16
// Email : [email protected]
/***************************************************************************************
*
* Given a string containing just the characters '(', ')', '{', '}', '[' and ']',
*
* determine if the input string is valid.
*
* The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.
*
* 做法:
* 栈的的处理
*
* 时间复杂度:
*
*
****************************************************************************************/
#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#define INF 0x3fffffff
using namespace std;
class Solution {
public:
bool judgeL(char c)
{
if((c == '[') || (c == '(') || (c == '{'))
return true;
return false;
}
bool match(char a, char b)
{
if((a == '[') && (b == ']'))
return true;
if((a == '{') && (b == '}'))
return true;
if((a == '(') && (b == ')'))
return true;
return false;
}
bool isValid(string s) {
stack<char> symbolStack;
for(int i=0; i<s.size(); i++)
{
if(judgeL(s[i]))
symbolStack.push(s[i]);
else
{
if(symbolStack.empty())
return false;
char now = symbolStack.top();
symbolStack.pop();
if(!match(now, s[i]))
return false;
}
}
if(symbolStack.empty())
return true;
return false;
}
};
int main() {
Solution *test = new Solution();
int data[] = {};
vector<int> x(data, data + sizeof(data) / sizeof(data[0]));
printf("%d\n", test->isValid("([])"));
return 0;
}