g1001_1100.s1054_distant_barcodes.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g1001_1100.s1054_distant_barcodes;
// #Medium #Array #Hash_Table #Sorting #Greedy #Heap_Priority_Queue #Counting
// #2022_02_28_Time_45_ms_(64.21%)_Space_69.1_MB_(71.24%)
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class Solution {
public int[] rearrangeBarcodes(int[] barcodes) {
Map cnt = new HashMap<>();
for (int i : barcodes) {
cnt.put(i, cnt.getOrDefault(i, 0) + 1);
}
List> list = new ArrayList<>(cnt.entrySet());
list.sort(Map.Entry.comparingByValue().reversed());
int l = barcodes.length;
int i = 0;
int[] res = new int[l];
for (Map.Entry e : list) {
int time = e.getValue();
while (time-- > 0) {
res[i] = e.getKey();
i += 2;
if (i >= barcodes.length) {
i = 1;
}
}
}
return res;
}
}