Leetcode - 20. Valid Parentheses

最新推荐文章于 2019-01-24 01:21:41 发布

all-is-well

最新推荐文章于 2019-01-24 01:21:41 发布

阅读量347

点赞数

分类专栏： leetcode 文章标签： leetcode stack

本文链接：https://blog.csdn.net/Noshandow/article/details/51476689

版权

leetcode 专栏收录该内容

18 篇文章 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.

解法 using stack

bool isValid(string s) {
        stack<char> paren;
        for (char& 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: ; // pass
            }
        }
        return paren.empty() ;
    }