feat: add java solution to lc problem: No.0846. Hand of Straights (doocs#552)

Author: hongyiheng

solution/0800-0899/0846.Hand of Straights/README.md

@@ -65,7 +65,33 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean isNStraightHand(int[] hand, int groupSize) { 
+        if (hand.length % groupSize != 0) {
+            return false;
+        }
+        TreeMap<Integer, Integer> mp = new TreeMap<>();
+        for (int item : hand) {
+            mp.put(item, mp.getOrDefault(item, 0) + 1);
+        }
+
+        while (mp.size() > 0) {
+            int start = mp.firstKey();
+            for (int i = start; i < start + groupSize; 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;
+    }
+}
 ```
 
 ### **...**

solution/0800-0899/0846.Hand of Straights/README_EN.md

@@ -53,7 +53,33 @@
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean isNStraightHand(int[] hand, int groupSize) { 
+        if (hand.length % groupSize != 0) {
+            return false;
+        }
+        TreeMap<Integer, Integer> mp = new TreeMap<>();
+        for (int item : hand) {
+            mp.put(item, mp.getOrDefault(item, 0) + 1);
+        }
+
+        while (mp.size() > 0) {
+            int start = mp.firstKey();
+            for (int i = start; i < start + groupSize; 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;
+    }
+}
 ```
 
 ### **...**

solution/0800-0899/0846.Hand of Straights/Solution.java

@@ -0,0 +1,27 @@
+class Solution {
+    public boolean isNStraightHand(int[] hand, int groupSize) {
+        if (hand.length % groupSize != 0) {
+            return false;
+        }
+        TreeMap<Integer, Integer> mp = new TreeMap<>();
+        for (int item : hand) {
+            mp.put(item, mp.getOrDefault(item, 0) + 1);
+        }
+
+        while (mp.size() > 0) {
+            int start = mp.firstKey();
+            for (int i = start; i < start + groupSize; 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;
+    }
+}