题解 | #有效括号序列#

import java.util.*;


public class Solution {
    /**
     * 
     * @param s string字符串 
     * @return bool布尔型
     */
    public boolean isValid (String s) {
        // write code here
        Stack<Integer>stack1=new Stack<>();
        Queue<Integer>queue=new LinkedList<>();
        try{
            for(int i=0;i<s.length();i++){
                switch(s.charAt(i)){
                    case '(':
                        stack1.push(1);
                        break;
                    case ')':
                        if(stack1.pop()!=1) return false;
                        break;
                    case '[':
                        stack1.push(2);
                        break;
                    case ']':
                        if(stack1.pop()!=2) return false;
                        break;
                    case '{':
                        stack1.push(3);
                        break;
                    case '}':
                        if(stack1.pop()!=3) return false;
                }
            }
        }
        catch(Exception e){return false;}
        if(!stack1.isEmpty())
            return false;
        return true;

    }
}