feat: add java solution to lc problem: No.1296.Divide Array in Sets of K Consecutive Numbers (#553)

Author: hongyiheng

Diff for: solution/1200-1299/1296.Divide Array in Sets of K Consecutive Numbers/README.md

@@ -76,7 +76,33 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean isPossibleDivide(int[] nums, int k) {
+        if (nums.length % k != 0) {
+            return false;
+        }
+        TreeMap<Integer, Integer> mp = new TreeMap<>();
+        for (int item : nums) {
+            mp.put(item, mp.getOrDefault(item, 0) + 1);
+        }
+
+        while (mp.size() > 0) {
+            int start = mp.firstKey();
+            for (int i = start; i < start + k; i++) {
+                if (!mp.containsKey(i)) {
+                    return false;
+                }
+                int time = mp.get(i);
+                if (time == 1) {
+                    mp.remove(i);
+                } else {
+                    mp.replace(i, time - 1);
+                }
+            }
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

Diff for: solution/1200-1299/1296.Divide Array in Sets of K Consecutive Numbers/README_EN.md

@@ -63,7 +63,33 @@ Return <code>True</code> if it is possible.<strong> </strong>Otherwise, return <
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean isPossibleDivide(int[] nums, int k) {
+        if (nums.length % k != 0) {
+            return false;
+        }
+        TreeMap<Integer, Integer> mp = new TreeMap<>();
+        for (int item : nums) {
+            mp.put(item, mp.getOrDefault(item, 0) + 1);
+        }
+
+        while (mp.size() > 0) {
+            int start = mp.firstKey();
+            for (int i = start; i < start + k; i++) {
+                if (!mp.containsKey(i)) {
+                    return false;
+                }
+                int time = mp.get(i);
+                if (time == 1) {
+                    mp.remove(i);
+                } else {
+                    mp.replace(i, time - 1);
+                }
+            }
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

Diff for: solution/1200-1299/1296.Divide Array in Sets of K Consecutive Numbers/Solution.java

@@ -0,0 +1,27 @@
+class Solution {
+    public boolean isPossibleDivide(int[] nums, int k) {
+        if (nums.length % k != 0) {
+            return false;
+        }
+        TreeMap<Integer, Integer> mp = new TreeMap<>();
+        for (int item : nums) {
+            mp.put(item, mp.getOrDefault(item, 0) + 1);
+        }
+
+        while (mp.size() > 0) {
+            int start = mp.firstKey();
+            for (int i = start; i < start + k; i++) {
+                if (!mp.containsKey(i)) {
+                    return false;
+                }
+                int time = mp.get(i);
+                if (time == 1) {
+                    mp.remove(i);
+                } else {
+                    mp.replace(i, time - 1);
+                }
+            }
+        }
+        return true;
+    }
+}