20. Valid Parentheses

最新推荐文章于 2022-02-10 13:47:19 发布

郭大侠写leetcode

最新推荐文章于 2022-02-10 13:47:19 发布

阅读量236

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u013547284/article/details/70208394

版权

leetcode 专栏收录该内容

46 篇文章 1 订阅

订阅专栏

题目链接：https://leetcode.com/problems/valid-parentheses/#/description

Description

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.

题解

典型堆栈问题

My Answer

class Solution {
public:
    bool isValid(string s) {
        stack<char> paren;
        for(auto c : s){
            switch(c){
                case '(':
                case '{':
                case '[': paren.push(c); break;
                case ')': if(paren.empty() || paren.top() != '(') return false; else paren.pop(); break;
                case '}': if(paren.empty() || paren.top() != '{') return false; else paren.pop(); break;
                case ']': if(paren.empty() || paren.top() != '[') return false; else paren.pop(); break;
                default: ;
            }
        }
        return paren.empty();
    }
};