括号匹配（栈）

import java.util.*;
public class Main{
      public static void main(String[] args) {
            Scanner scan=new Scanner(System.in);
            Stack<Character> sta=new Stack<Character>();
            Map<Character, Character> map=new HashMap<Character, Character>();
            map.put(‘(‘, ‘)‘);
            map.put(‘[‘, ‘]‘);
            map.put(‘{‘, ‘}‘);
            String s=scan.nextLine();
            char[] a=s.toCharArray();
            boolean flag=true;
            int cnt1=0,cnt2=0;
            for(int i=0;i<a.length;i++){
                if(a[i]==‘(‘ ||a[i]==‘[‘ ||a[i]==‘{‘)  {
                      sta.push(a[i]);
                      cnt1++;
                }
                else if(a[i]==‘)‘ ||a[i]==‘]‘ ||a[i]==‘}‘){
                      cnt2++;
                      if(!sta.isEmpty() && map.get(sta.peek())==a[i]){
                            sta.pop();
                      }
                     else{
                           flag=false;//不要break，因为需要继续统计数量
                     }
                }
            }
            System.out.println(cnt1+" "+cnt2);
            if(flag && sta.isEmpty()) System.out.println("YES");//判栈空
            else System.out.println("NO");
    }
}