classSolution{publicintmaxDepth(String s){
Stack<Character> stack =newStack<>();int ans =0;char[] ch = s.toCharArray();if(ch.length ==0)return0;int cnt =0;for(int i =0; i < ch.length; i++){if(ch[i]=='('){
stack.push(ch[i]);}if(ch[i]==')'){
stack.pop();}
ans = Math.max(ans,stack.size());}return ans;}}
最大网络秩
classSolution{publicintmaximalNetworkRank(int n,int[][] roads){
List<Set<Integer>> list =newArrayList<>();for(int i =0; i < n; i++){
list.add(newHashSet<>());}int row = roads.length;int col =2;for(int i =0; i < row; i++){
list.get(roads[i][0]).add(roads[i][1]);
list.get(roads[i][1]).add(roads[i][0]);}int ans =0;for(int i =0; i < n; i++){for(int j =0; j < n; j++){if(i != j){int diff = list.get(i).contains(j)?1:0;int pre = list.get(i).size()+ list.get(j).size()- diff;
ans = Math.max(ans,pre);}}}return ans;}}