LeetCode 20 Valid Parentheses

最新推荐文章于 2022-01-09 05:17:54 发布

lizhaowei213

最新推荐文章于 2022-01-09 05:17:54 发布

阅读量402

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/lizhaowei213/article/details/51108355

LeetCode 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一种使用栈来验证包含圆括号、方括号及大括号的字符串是否有效的方法。通过检查括号的正确闭合顺序，确保每一对括号都能正确匹配。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

20. Valid Parentheses

Total Accepted: 102983 Total Submissions: 352605 Difficulty: Easy

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.

Subscribe to see which companies asked this question

Have you met this question in a real interview?

验证字符串括号是否配对合法。

经典问题了

用个栈就解决。

class Solution {
public:
    bool isValid(string s) 
    {
        int len=s.length();
        if(len%2)
            return false;
        stack<char> st;
        for(int i=0;i<len;i++)
        {
                if(!st.empty())
                {
                        if ((st.top()=='['&&s[i]==']')||(st.top()=='('&&s[i]==')')||(st.top()=='{'&&s[i]=='}'))
                                st.pop();
                        else
                                st.push(s[i]);
                }
                else
                {
                        st.push(s[i]);
                }
        }
        return st.empty();
    }
};