LeetCode : 20. Valid Parentheses 验证括号

最新推荐文章于 2022-09-09 00:10:56 发布

青盏

最新推荐文章于 2022-09-09 00:10:56 发布

阅读量188

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_16234613/article/details/89843376

版权

LeetCode 专栏收录该内容

154 篇文章 1 订阅

订阅专栏

试题
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
代码
关键点：如果相邻两个char能够组合成一对括号，那么他们肯定是一对。这样的话我们可以优先把这些消掉。

class Solution {
    public boolean isValid(String s) {
        if(s==null || s.length()==0) return true;
        Stack<Character> sta = new Stack<>();
        for(int i=0; i<s.length(); i++){
            char cur = s.charAt(i);
            if(sta.isEmpty()){
                sta.push(cur);
                continue;
            }
            if( (cur==')' && sta.peek()=='(') || (cur==']' && sta.peek()=='[') || (cur=='}' && sta.peek()=='{') ){
                sta.pop();
            }else{
                sta.push(cur);
            }
        }
        return sta.isEmpty();
    }
}