括号匹配

最新推荐文章于 2023-12-22 09:10:57 发布

tik_boa

最新推荐文章于 2023-12-22 09:10:57 发布

阅读量173

点赞数

分类专栏：刷leetcode

本文链接：https://blog.csdn.net/qq_39807379/article/details/80512704

版权

刷leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

示例 1:

输入: "()"
输出: true

示例 2:

输入: "()[]{}"
输出: true

示例 3:

输入: "(]"
输出: false

示例 4:

输入: "([)]"
输出: false

示例 5:

输入: "{[]}"
输出: true

class Solution {
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<>();
		Stack<Character> invstack = new Stack<>();
        if(s.length() == 0)
			return true;
		for(int i =0; i < s.length(); i++){
			stack.push(s.charAt(i));
		}
		while(!stack.isEmpty() && s.length() != 1){
			if(!invstack.isEmpty()){
				if(stack.peek() == '(' && invstack.peek() == ')' ){
					stack.pop();
					invstack.pop();
				}
				else if(stack.peek() == '{' && invstack.peek() == '}' ){
					stack.pop();
					invstack.pop();
				}
				else if(stack.peek() == '[' && invstack.peek() == ']'){
					stack.pop();
					invstack.pop();
				}
				else	invstack.push(stack.pop());
				if(invstack.isEmpty() && stack.isEmpty())
					return true;
			}
			else invstack.push(stack.pop());
		}
		return false;
    }
}