add 2055

fishercoder1534 · fishercoder1534 · commit d3cf905ca534 · 2021-10-30T10:12:45.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2055|[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2055.java) ||Medium||
 |2053|[Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2053.java) ||Easy||
 |2050|[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2050.java) ||Hard||
 |2048|[Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2048.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2055.java b/src/main/java/com/fishercoder/solutions/_2055.java
@@ -0,0 +1,45 @@
+package com.fishercoder.solutions;
+
+import java.util.TreeMap;
+
+public class _2055 {
+    public static class Solution1 {
+        public int[] platesBetweenCandles(String s, int[][] queries) {
+            int[] ans = new int[queries.length];
+            TreeMap<Integer, Integer> treeMap = new TreeMap<>();
+            int left = 0;
+            int right = 0;
+            while (left < s.length() && s.charAt(left) != '|') {
+                left++;
+            }
+            treeMap.put(left, 0);
+            int count = 0;
+            while (left < s.length()) {
+                if (s.charAt(left) == '|') {
+                    right = left + 1;
+                    while (right < s.length() && s.charAt(right) != '|') {
+                        count++;
+                        right++;
+                    }
+                    if (right < s.length()) {
+                        treeMap.put(right, count);
+                    }
+                    left = right;
+                } else {
+                    left++;
+                }
+            }
+            for (int i = 0; i < queries.length; i++) {
+                int l = queries[i][0];
+                int r = queries[i][1];
+                Integer start = treeMap.ceilingKey(l);
+                Integer end = treeMap.floorKey(r);
+                if (start == null || end == null || start >= end) {
+                    continue;
+                }
+                ans[i] = treeMap.get(end) - treeMap.get(start);
+            }
+            return ans;
+        }
+    }
+}
