add 2054

Author: fishercoder1534

README.md

@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ ★
 |  #  |      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||
+|2054|[Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2054.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||

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

@@ -0,0 +1,40 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _2054 {
+    public static class Solution1 {
+        public int maxTwoEvents(int[][] events) {
+            /**Credit: https://leetcode.com/nevergiveup/ on https://leetcode.com/contest/biweekly-contest-64/ranking/*/
+            Arrays.sort(events, (a, b) -> a[0] - b[0]);
+            int[] max = new int[events.length];
+            for (int i = events.length - 1; i >= 0; i--) {
+                if (i == events.length - 1) {
+                    max[i] = events[i][2];
+                } else {
+                    max[i] = Math.max(events[i][2], max[i + 1]);
+                }
+            }
+            int ans = 0;
+            for (int i = 0; i < events.length; i++) {
+                int end = events[i][1];
+                int left = i + 1;
+                int right = events.length;
+                while (left < right) {
+                    int mid = left + (right - left) / 2;
+                    if (events[mid][0] <= end) {
+                        left = mid + 1;
+                    } else {
+                        right = mid;
+                    }
+                }
+                int value = events[i][2];
+                if (right >= 0 && right < events.length) {
+                    value += max[right];
+                }
+                ans = Math.max(ans, value);
+            }
+            return ans;
+        }
+    }
+}

src/test/java/com/fishercoder/_2054Test.java

@@ -0,0 +1,44 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1;
+import com.fishercoder.solutions._2054;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+import static org.junit.Assert.assertEquals;
+
+public class _2054Test {
+    private static _2054.Solution1 solution1;
+    private static int[][] events;
+    private static int expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2054.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        events = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,3,2],[4,5,2],[2,4,3]");
+        expected = 4;
+        assertEquals(expected, solution1.maxTwoEvents(events));
+    }
+
+    @Test
+    public void test2() {
+        events = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,3,2],[4,5,2],[1,5,5]");
+        expected = 5;
+        assertEquals(expected, solution1.maxTwoEvents(events));
+    }
+
+    @Test
+    public void test3() {
+        events = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,5,3],[1,5,1],[6,6,5]");
+        expected = 8;
+        assertEquals(expected, solution1.maxTwoEvents(events));
+    }
+
+
+}