2022.8.8-----leetcode.761

 public String makeLargestSpecial(String s) {//If 1 is (, 0 is), then s can be regarded as a legal bracket sequence with only one pair of brackets in the outermost layer#//Remove the outermost layer, it can be divided into several #, they belong to the same layer//One operation is to sort the # of the same layer to get the maximum resultif (s.length() == 0) return s;List list = new ArrayList<>();char[] cs = s.toCharArray();//Remove the outermost layer of the # of the previous layer, and divide it to get this layer#for (int i = 0, j = 0, k = 0; i < cs.length; i++) {k += cs[i] == '1' ? 1 : -1;//When k=0, get a complete#if (k == 0) {String next=makeLargestSpecial(s.substring(j + 1, i));//Remove the outermost layer and enter the next layer of sortinglist.add("1" + next + "0");//After sorting the next time, add the outermost layerj = i + 1;}}Collections.sort(list, (a, b)->(b + a).compareTo(a + b));//Sort this layerStringBuilder sb = new StringBuilder();for (String str : list) sb.append(str);//Splicing returnreturn sb.toString();}