add 2399

fishercoder1534 · fishercoder1534 · commit 8ff22caa4027 · 2022-09-04T06:34:36.000-07:00
diff --git a/README.md b/README.md
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
-| 2395 |[Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2395.java)                                                                     || Easy                                                                             ||
+| 2399 |[Check Distances Between Same Letters](https://leetcode.com/problems/check-distances-between-same-letters/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2399.java)                                                                     || Medium                                                                        ||
+| 2395 |[Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2395.java)                                                                     || Easy                                                                          ||
 | 2380 |[Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2380.java)                                                                     || Medium                                                                        ||
 | 2379 |[Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2379.java)                                                                     || Easy                                                                          ||
 | 2367 |[Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2367.java)                                                                     || Easy                                                                          ||
diff --git a/src/main/java/com/fishercoder/solutions/_2399.java b/src/main/java/com/fishercoder/solutions/_2399.java
@@ -0,0 +1,33 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _2399 {
+    public static class Solution1 {
+        public boolean checkDistances(String s, int[] distance) {
+            Map<Character, int[]> map = new HashMap<>();
+            int i = 0;
+            for (char c : s.toCharArray()) {
+                if (!map.containsKey(c)) {
+                    map.put(c, new int[]{-1, -1});
+                }
+                int[] indices = map.get(c);
+                if (indices[0] == -1) {
+                    indices[0] = i;
+                } else {
+                    indices[1] = i;
+                }
+                i++;
+            }
+            for (char c : map.keySet()) {
+                int index = c - 'a';
+                int[] indices = map.get(c);
+                if (distance[index] + 1 != indices[1] - indices[0]) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}
