LeetCode-Solutions/20.cpp at main · Linisac/LeetCode-Solutions · 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
52
53
54
class Solution {
public:
    bool isValid(string s) {
        int leng = s.length();
        vector<char> stack;
        int position = 0;
        while (position < leng) {
            switch(s[position]) {
                case '(':
                stack.push_back('(');
                break;
                case ')':
                if (stack.empty() == true || stack.back() != '(') {
                    return false;
                }
                else {
                    stack.pop_back();
                }
                break;
                case '{':
                stack.push_back('{');
                break;
                case '}':
                if (stack.empty() == true || stack.back() != '{') {
                    return false;
                }
                else {
                    stack.pop_back();
                }
                break;
                case '[':
                stack.push_back('[');
                break;
                case ']':
                if (stack.empty() == true || stack.back() != '[') {
                    return false;
                }
                else {
                    stack.pop_back();
                }
                break;
                default:
                return false;
            }
            position++;
        }
        if (stack.empty() == true) {
            return true;
        }
        else {
            return false;
        }
    }
};