LeetCode 20. Valid Parentheses

最新推荐文章于 2024-02-05 23:11:57 发布

原创最新推荐文章于 2024-02-05 23:11:57 发布 · 200 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解 C++版专栏收录该内容

138 篇文章

订阅专栏

本文介绍了一种使用栈和哈希表的数据结构来判断字符串中括号是否正确匹配的方法。通过遍历输入字符串，利用栈存储左括号并在遇到右括号时进行匹配，确保括号类型一致且顺序正确。该算法适用于括号平衡检查，如编程语言中的代码校验。

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

Given a string 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.
Note that an empty string is also considered valid.

Example 1:

Input: "()"
Output: true

Example 2:

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

Example 3:

Input: "(]"
Output: false

Example 4:

Input: "([)]"
Output: false

Example 5:

Input: "{[]}"
Output: true

栈+哈希

class Solution {
public:
    stack<char> s1;
    stack<char> s2;
    unordered_set<char> set1{'(','[','{'};
    unordered_map<char, char> map1{{')','('},{']','['},{'}','{'}};
    
    bool isValid(string s) {
        if (s.size() % 2) return false;
        for (auto c : s) {
            if (set1.count(c)) {
                s1.push(c);
            }
            else {
                if (s1.size() && s1.top() == map1[c]) {
                    s1.pop();
                }
                else s2.push(c);
            }
        }
        return s1.empty() && s2.empty();
    }
};