Valid Parentheses

最新推荐文章于 2021-02-23 15:41:16 发布

Pango_lulu

最新推荐文章于 2021-02-23 15:41:16 发布

阅读量366

点赞数

分类专栏： Leetcode 文章标签：栈

本文链接：https://blog.csdn.net/pango_cs/article/details/42112973

版权

Leetcode 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

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.

Tag: 栈

bool isValid(string s)
{
    std::stack<char> st;
    for(int i = 0; i < s.size(); i++)
    {
        if(s[i] == '(' || s[i] == '{' || s[i] == '[')
        {
            st.push(s[i]);
            continue;
        }
        switch(s[i])
        {
        case ')':
            if(st.empty() || st.top() != '(')
            {
                return false;
            }
            else
            {
                st.pop();
            }
            continue;
        case '}':
            if(st.empty() || st.top() != '{')
            {
                return false;
            }
            else
            {
                st.pop();
            }
            continue;
        case ']':
            if(st.empty() || st.top() != '[')
            {
                return false;
            }
            else
            {
                st.pop();
            }
            continue;
        }
    }
    if(st.empty())
        return true;
    else
        return false;
}