【数据结构入门_栈】 Leetcode 20.有效的括号

最新推荐文章于 2024-07-20 22:34:59 发布

cwtnice

最新推荐文章于 2024-07-20 22:34:59 发布

阅读量217

点赞数

分类专栏：每日一题文章标签： leetcode

本文链接：https://blog.csdn.net/cwtnice/article/details/125584425

版权

每日一题专栏收录该内容

118 篇文章 2 订阅

订阅专栏

原题链接：Leetcode 20. Valid Parentheses

Given a string s containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.

Example 1:

Input: s = "()"
Output: true

Example 2:

Input: s = "()[]{}"
Output: true

Example 3:

Input: s = "(]"
Output: false

Constraints:

1 <= s.length <= 10⁴
s consists of parentheses only ‘()[]{}’.

方法一：栈

思路：

栈的应用之括号匹配模板题

c++代码：

class Solution {
public:
    bool isValid(string s) {
        stack<char> st;

        // 遍历整个字符串
        for(auto c : s){
            // 左括号就入栈
            if(c == '(' || c == '[' || c == '{'){
                st.push(c);
            }
            else{
                if(st.empty()){
                    return false;
                }
                if(st.top() == '(' && c == ')') st.pop();
                else if(st.top() == '[' && c == ']') st.pop();
                else if(st.top() == '{' && c == '}') st.pop();
                else
                    return false;
            }
        }

        if(!st.empty())
            return false;

        return true;
    }
};