add 2347

Author: fishercoder1534

README.md

@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
-| 2341 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2341.java)                                                                      || Easy                                                                             ||
+| 2347 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/best-poker-hand/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2347.java)                                                                     || Easy                                                                             ||
+| 2341 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2341.java)                                                                     || Easy                                                                             ||
 | 2335 |[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2335.java)                                                                     || Easy                                                                             ||
 | 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java)                                                                     || Easy                                                                             ||
 | 2326 |[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2326.java)                                                                     || Medium                                                                        ||

src/main/java/com/fishercoder/solutions/_2347.java

@@ -0,0 +1,35 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Map;
+import java.util.Set;
+
+public class _2347 {
+    public static class Solution1 {
+        public String bestHand(int[] ranks, char[] suits) {
+            Set<Character> set = new HashSet<>();
+            for (char c : suits) {
+                set.add(c);
+            }
+            if (set.size() == 1) {
+                return "Flush";
+            }
+            Map<Integer, Integer> map = new HashMap<>();
+            for (int i : ranks) {
+                map.put(i, map.getOrDefault(i, 0) + 1);
+            }
+            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+                if (entry.getValue() >= 3) {
+                    return "Three of a Kind";
+                }
+            }
+            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+                if (entry.getValue() == 2) {
+                    return "Pair";
+                }
+            }
+            return "High Card";
+        }
+    }
+}