Leetcode 20. Valid Parentheses

作者: SnailTyan | 来源:发表于2018-09-25 18:36 被阅读36次

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Valid Parentheses

2. Solution

Version 1

class Solution {
public:
    bool isValid(string s) {
        stack<char> st;
        for(char ch : s) {
            if(st.empty()) {
                st.push(ch);
            }
            else {
                if((ch == ')' && st.top() == '(') || (ch == ']' && st.top() == '[') || (ch == '}' && st.top() == '{')) {
                    st.pop();
                }
                else {
                    st.push(ch);
                }
            }
        }
        return st.empty();
    }
};

Version 2

class Solution {
public:
    bool isValid(string s) {
        stack<char> st;
        for(char ch : s) {
            if(st.empty()) {
                st.push(ch);
            }
            else {
                if((ch == ')' && st.top() != '(') || (ch == ']' && st.top() != '[') || (ch == '}' && st.top() != '{')) {
                    return false;
                }
                else if(ch == ')' || ch == ']' || ch == '}'){
                    st.pop();
                }
                else {
                    st.push(ch);
                }
            }
        }
        return st.empty();
    }
};