LeetCode:Valid Parentheses

最新推荐文章于 2020-06-23 10:38:49 发布

原创最新推荐文章于 2020-06-23 10:38:49 发布 · 1.8k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Stack #String

LeetCode OJ 同时被 2 个专栏收录

216 篇文章

订阅专栏

LeetCode解题记录

216 篇文章

订阅专栏

本文介绍了一个简单的算法，用于判断字符串中的括号是否正确配对。通过使用栈数据结构，算法可以有效地检查包括圆括号、方括号和花括号在内的各种括号是否按正确的顺序关闭。

Valid Parentheses

Total Accepted: 111710 Total Submissions: 375574 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

Hide Tags

Stack String

Hide Similar Problems

(M) Generate Parentheses (H) Longest Valid Parentheses (H) Remove Invalid Parentheses

c++ code:

class Solution {
public:
    bool isValid(string s) {
        stack<char> ss;
        for(int i=0;i<s.size();i++) {
            if(!ss.empty() && isPair(ss.top(), s[i])) ss.pop();
            else ss.push(s[i]);
        }
        return ss.empty();
    }
    bool isPair(char left, char right) {
        return '['==left && ']'==right || '('==left && ')'==right || '{'==left && '}'==right;
    }
};