LeetCode/ValidParentheses_20.cpp at master · ZoeVonFeng/LeetCode · GitHub

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
#include <iostream>
#include <string>
#include <stack>
using namespace std;
class Solution
{
public:
    bool isValid(string s)
    {
        stack <char>store;
        for (int i = 0; i <  s.length(); i++)
        {
            if (s[i] == '(' || s[i] == '{' || s[i] == '[')
                store.push(s[i]);
            else if (s[i] == ')')
            {
                if (store.top() == '(')
                    store.pop();
                else
                    return false;
            }
            else if (s[i] == ']')
            {
                if (store.top() == '[')
                    store.pop();
                else
                    return false;
            }
            else if (s[i] == '}')
            {
                if (store.top() == '{')
                    store.pop();
                else
                    return false;
            }
        }
        if (store.empty())
            return true;
        else
            return false;
    }
};

int main()
{
    Solution s;
    if (s.isValid("]"))
      cout << "True" << endl;
    else
      cout << "False" << endl;
}