【LeeCode】有效括号深度 (自测)

package com.company;
import java.util.*;

class Solution {

    public void getKuoHao(String str) {
        Stack<Character> stack = new Stack<>();
        int max = 0;
        int count = 0;
        for (int i = 0; i < str.length(); i++) {
            char c = str.charAt(i);
            if (c == '('){
                stack.push(c);
            }else if (c == ')' && stack.search('(') == 1 ){
                count++;
                max = Math.max(max, count);
                stack.pop();
                if (stack.size() == 0){
                    count = 0;
                }
            }
        }
        System.out.println(max);
    }
}
public class Test {
    public static void main(String[] args) {
        String sss = "()()()";    // 输出1
        String str3 = "()(())()"; // 输出2

        new Solution().getKuoHao(sss);
        new Solution().getKuoHao(str3);
    }
}