[leetcode 20] Valid Parentheses

最新推荐文章于 2025-09-10 22:03:14 发布

原创最新推荐文章于 2025-09-10 22:03:14 发布 · 201 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #stack

[LeetCode 刷题] 专栏收录该内容

158 篇文章

订阅专栏

本文介绍了一种使用栈数据结构来验证括号是否正确配对的方法。对于包含'(',')','[',']','{','}

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) {
        string left = "([{";
        string right = ")]}";
        stack<char> p;
        for (auto i : s) {
            if (left.find(i) != string::npos) {
                p.push(i);
            } else {
                if (p.empty() || p.top() != left[right.find(i)]) {
                    return false;
                }
                p.pop();
            }
        }
        return p.empty();
        
    }
};