_1405.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.PriorityQueue;

publicclass_1405 {
publicstaticclassSolution1 {
publicStringlongestDiverseString(inta, intb, intc) {
PriorityQueue<Tuple> maxHeap = newPriorityQueue<>((x, y) -> y.count - x.count);
if (a > 0) {
maxHeap.offer(newTuple('a', a));
 }
if (b > 0) {
maxHeap.offer(newTuple('b', b));
 }
if (c > 0) {
maxHeap.offer(newTuple('c', c));
 }
StringBuildersb = newStringBuilder();
while (maxHeap.size() > 1) {
Tupleone = maxHeap.poll();
if (one.count >= 2) {
sb.append(one.c);
sb.append(one.c);
one.count -= 2;
 } else {
sb.append(one.c);
one.count--;
 }

Tupletwo = maxHeap.poll();
if (two.count >= 2 && one.count < two.count) {
sb.append(two.c);
sb.append(two.c);
two.count -= 2;
 } else {
sb.append(two.c);
two.count--;
 }

// only after the above two poll() calls, then do below:
if (one.count > 0) {
maxHeap.offer(one);
 }
if (two.count > 0) {
maxHeap.offer(two);
 }
 }
if (!maxHeap.isEmpty()) {
if (sb.length() == 0 || sb.charAt(sb.length() - 1) != maxHeap.peek().c) {
if (maxHeap.peek().count >= 2) {
sb.append(maxHeap.peek().c);
sb.append(maxHeap.peek().c);
 } else {
sb.append(maxHeap.peek().c);
 }
 }
 }
returnsb.toString();
 }

classTuple {
charc;
intcount;

publicTuple(charc, intcount) {
this.c = c;
this.count = count;
 }
 }
 }
}