2022.2.7-----leetcode.1405

//不会了class Solution { public String longestDiverseString(int a, int b, int c) { StringBuilder res = new StringBuilder(); Pair[] arr = {new Pair(a, 'a'), new Pair(b, 'b'), new Pair(c, 'c')}; while (true) { Arrays.sort(arr, (p1, p2) -> p2.freq - p1.freq); boolean hasNext = false; for (Pair pair : arr) { if (pair.freq <= 0) { break; } int m = res.length(); if (m >= 2 && res.charAt(m - 2) == pair.ch && res.charAt(m - 1) == pair.ch) { continue; } hasNext = true; res.append(pair.ch); pair.freq--; break; } if (!hasNext) { break; } } return res.toString(); } class Pair { int freq; char ch; public Pair(int freq, char ch) { this.freq = freq; this.ch = ch; } }}