Leetcode-20. Valid Parentheses

最新推荐文章于 2020-01-22 13:03:47 发布

Wu_uuuu

最新推荐文章于 2020-01-22 13:03:47 发布

阅读量235

点赞数

本文链接：https://blog.csdn.net/wanna_wsl/article/details/67639132

版权

数据结构及算法专栏收录该内容

111 篇文章 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.
括号匹配

思路

借助栈即可实现

代码

class Solution {
public:
    bool isValid(string s) {
        stack<int> stac;
        for(int i = 0; i < s.size(); i++) {
            if(s[i] == '(' || s[i] == '[' || s[i] == '{')
                stac.push(s[i]);
            else {
                if(stac.empty())
                    return false;
                if(s[i] == ')') {
                    if(stac.top() != '(')
                        return false;
                }
                else if(s[i] == ']') {
                    if(stac.top() != '[')
                        return false;
                }
                else if(s[i] == '}') {
                    if(stac.top() != '{')
                        return false;
                }
                stac.pop();
            }
        }
        return stac.empty() ? true : false;
    }
};