2020-09-14

class Solution {
    public String rearrangeString(String s, int k) {        if(s == null || s.length() == 0){            return s;        }        HashMap<Character, Integer> hm = new  Integer>();        for(int i = 0; i<s.length(); i++){            hm.put(s.charAt(i), hm.getOrDefault(s.charAt(i), 0)+1);        }        PriorityQueue<Map.Entry<Character, Integer>> maxHeap = new PriorityQueue<Map.Entry<Character, Integer>>(            (a, b) -> b.getValue() - a.getValue()        );        maxHeap.addAll(hm.entrySet());        LinkedList<Map.Entry<Character, Integer>> que = new LinkedList<Map.Entry<Character, Integer>>();        StringBuilder sb = new StringBuilder();        while(!maxHeap.isEmpty()){            Map.Entry<Character, Integer> cur = maxHeap.poll();            sb.append(cur.getKey());            cur.setValue(cur.getValue()-1);            que.add(cur);            if(que.size() < k){                continue;            }            Map.Entry<Character, Integer> head = que.poll();            if(head.getValue() > 0){                maxHeap.add(head);            }        }        return sb.length() == s.length() ? sb.toString() : "";    }}