add 2155

fishercoder1534 · fishercoder1534 · commit 0aa304f4991b · 2022-01-29T22:08:30.000-08: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                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2155|[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2155.java) ||Medium||
 |2154|[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2154.java) ||Easy||
 |2150|[Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2150.java) ||Medium||
 |2149|[Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2149.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2155.java b/src/main/java/com/fishercoder/solutions/_2155.java
@@ -0,0 +1,34 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.TreeMap;
+
+public class _2155 {
+    public static class Solution1 {
+        public List<Integer> maxScoreIndices(int[] nums) {
+            TreeMap<Integer, List<Integer>> treeMap = new TreeMap<>();
+            int ones = 0;
+            for (int num : nums) {
+                ones += num;
+            }
+            int zeroes = 0;
+            List<Integer> l = new ArrayList<>();
+            l.add(0);
+            treeMap.put(ones, l);
+            for (int i = 0; i < nums.length; i++) {
+                if (nums[i] == 0) {
+                    zeroes++;
+                } else {
+                    ones--;
+                }
+                int score = ones + zeroes;
+                List<Integer> list = treeMap.getOrDefault(score, new ArrayList<>());
+                Integer index = i + 1;
+                list.add(index);
+                treeMap.put(score, list);
+            }
+            return treeMap.lastEntry().getValue();
+        }
+    }
+}
