|
1 | 1 | classSolution { |
2 | | -publicStringreorganizeString(Strings) { |
3 | | -Map<Character,Integer>map =newHashMap<>(); |
4 | | -for (charc :s.toCharArray()) { |
5 | | -map.put(c,map.getOrDefault(c,0) +1); |
6 | | -} |
7 | | -PriorityQueue<Character>pq =newPriorityQueue<>( |
8 | | -(o1,o2) ->map.get(o2).compareTo(map.get(o1))); |
9 | | -pq.addAll(map.keySet()); |
10 | | -StringBuildersb =newStringBuilder(); |
11 | | -while (!pq.isEmpty()) { |
12 | | -charremoved =pq.poll(); |
13 | | -if (!sb.isEmpty() &&sb.charAt(sb.length() -1) ==removed) { |
14 | | -if (pq.isEmpty()) { |
15 | | -return""; |
| 2 | +publicStringreorganizeString(Strings) { |
| 3 | +Map<Character,Integer>map =newHashMap<>(); |
| 4 | +intmaxFrequency =0; |
| 5 | +charmaxFrequencyLetter =' '; |
| 6 | +intn =s.length(); |
| 7 | +for (charc :s.toCharArray()) { |
| 8 | +map.put(c,map.getOrDefault(c,0) +1); |
| 9 | +if (maxFrequency <map.get(c)) { |
| 10 | +maxFrequency =map.get(c); |
| 11 | +maxFrequencyLetter =c; |
| 12 | + } |
| 13 | + } |
| 14 | +if (maxFrequency > (n +1) /2) { |
| 15 | +return""; |
16 | 16 | } |
17 | | -charsecondRemoved =pq.poll(); |
18 | | -pq.add(removed); |
19 | | -sb.append(secondRemoved); |
20 | | -updateStructure(map,pq,secondRemoved); |
21 | | -}else { |
22 | | -sb.append(removed); |
23 | | -updateStructure(map,pq,removed); |
24 | | -} |
| 17 | +char[]letters =newchar[s.length()]; |
| 18 | +intidx =0; |
| 19 | +idx =insertLetter(n,map,maxFrequencyLetter,letters,idx); |
| 20 | +map.remove(maxFrequencyLetter); |
| 21 | +for (Characterkey :map.keySet()) { |
| 22 | +idx =insertLetter(n,map,key,letters,idx); |
| 23 | +} |
| 24 | +returnString.valueOf(letters); |
25 | 25 | } |
26 | | -returnsb.toString(); |
27 | | - } |
28 | 26 |
|
29 | | -privatevoidupdateStructure(Map<Character,Integer>map,PriorityQueue<Character>pq,charc) { |
30 | | -map.put(c,map.get(c) -1); |
31 | | -if (map.get(c) >0) { |
32 | | -pq.add(c); |
33 | | - }else { |
34 | | -map.remove(c); |
| 27 | +privatestaticintinsertLetter(intn,Map<Character,Integer>map,charmaxFrequencyLetter,char[]letters,intidx) { |
| 28 | +while (map.get(maxFrequencyLetter) >0) { |
| 29 | +if (idx >=n) { |
| 30 | +idx =1; |
| 31 | + } |
| 32 | +letters[idx] =maxFrequencyLetter; |
| 33 | +idx +=2; |
| 34 | +map.put(maxFrequencyLetter,map.get(maxFrequencyLetter) -1); |
| 35 | + } |
| 36 | +returnidx; |
35 | 37 | } |
36 | | - } |
37 | 38 | } |