_1296.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.TreeMap;

publicclass_1296 {
publicstaticclassSolution1 {
publicbooleanisPossibleDivide(int[] nums, intk) {
if (nums.length % k != 0) {
returnfalse;
 }
TreeMap<Integer, Integer> treeMap = newTreeMap();
intmin = nums[0];
for (intnum : nums) {
treeMap.put(num, treeMap.getOrDefault(num, 0) + 1);
min = Math.min(min, num);
 }
while (!treeMap.isEmpty()) {
if (!isConsecutiveK(treeMap, min, k)) {
returnfalse;
 }
min = findNextMin(treeMap);
if (min == Integer.MIN_VALUE) {
break;
 }
 }
returntrue;
 }

privateintfindNextMin(TreeMap<Integer, Integer> treeMap) {
returntreeMap.isEmpty()
 ? Integer.MIN_VALUE
 : treeMap.entrySet().iterator().next().getKey();
 }

privatebooleanisConsecutiveK(TreeMap<Integer, Integer> treeMap, intmin, intk) {
intcount = treeMap.get(min);
treeMap.remove(min);
for (inti = 1; i < k; i++) {
intkey = min + i;
if (!treeMap.containsKey(key) || treeMap.get(key) < count) {
returnfalse;
 } elseif (treeMap.get(key) > count) {
treeMap.put(key, treeMap.get(key) - count);
 } else {
treeMap.remove(key);
 }
 }
returntrue;
 }
 }
}