基於棧(Stack)實現括號匹配

public class BracketMatching {
    
       public static void main(String[] args) throws IOException {

        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        List<String> read = new ArrayList<>();
        while (true){
            String s = reader.readLine();
            if ("quit".equalsIgnoreCase(s)){
                break;
            }
            read.add(s);
        }
        //read.add("}}({}[]()((()))[{()}]{[([{[{{}}]}])]}");

        List<String> stringList = read.stream().flatMap(s -> Arrays.stream(s.split(""))).collect(Collectors.toList());
        Stack<String> stack = new Stack<>();
        for (int i =0;i < stringList.size();++i){
            if (stack.empty()){
                stack.push(stringList.get(i));
            }else {
                String pop = stack.pop();
                if ("{".equals(pop) && "}".equals(stringList.get(i))){

                }else if ("(".equals(pop) && ")".equals(stringList.get(i))){

                }else if ("[".equals(pop) && "]".equals(stringList.get(i))){

                }else {
                    stack.push(pop);
                    stack.push(stringList.get(i));
                }
            }
        }
        System.out.println(stack.empty());
    } 
}