forked from rost0413/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Valid_Parentheses.cpp
53 lines (48 loc) · 1.07 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
/*
Author: Weixian Zhou, ideazwx@gmail.com
Date: Jul 27, 2012
Problem: Valid Parentheses
Difficulty: easy
Source: http://www.leetcode.com/onlinejudge
Notes:
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.
Solution:
*/
#include <vector>
#include <set>
#include <climits>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
#include <stack>
using namespace std;
class Solution {
public:
bool isValid(string s) {
stack<char> stk;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(' || s[i] == '[' || s[i] == '{') {
stk.push(s[i]);
} else {
if (stk.empty()) {
return false;
}
char c = stk.top();
stk.pop();
if ((s[i] == ')' && c != '(') || (s[i] == ']' && c != '[')
|| (s[i] == '}' && c != '{')) {
return false;
}
}
}
if (!stk.empty()) {
return false;
}
return true;
}
};