add 2287

Author: fishercoder1534

README.md

@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ ★
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
 | 2288 |[Apply Discount to Prices](https://leetcode.com/problems/apply-discount-to-prices/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2288.java)                                                                     || Medium                                                                        ||
+| 2287 |[Rearrange Characters to Make Target String](https://leetcode.com/problems/rearrange-characters-to-make-target-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2288.java)                                                                     || Eaa                                                                           ||
 | 2284 |[Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2284.java)                                                                     || Medium                                                                        ||
 | 2283 |[Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2283.java)                                                                     || Easy                                                                          ||
 | 2279 |[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2279.java)                                                                     || Medium                                                                        ||

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

@@ -0,0 +1,25 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _2287 {
+    public static class Solution1 {
+        public int rearrangeCharacters(String s, String target) {
+            Map<Character, Integer> targetMap = new HashMap<>();
+            for (char c : target.toCharArray()) {
+                targetMap.put(c, targetMap.getOrDefault(c, 0) + 1);
+            }
+            Map<Character, Integer> sMap = new HashMap<>();
+            for (char c : s.toCharArray()) {
+                sMap.put(c, sMap.getOrDefault(c, 0) + 1);
+            }
+            int result = Integer.MAX_VALUE;
+            for (char c : targetMap.keySet()) {
+                int targetCount = targetMap.get(c);
+                result = Math.min(result, sMap.getOrDefault(c, 0) / targetCount);
+            }
+            return result;
+        }
+    }
+}