add 598

fishercoder1534 · fishercoder1534 · commit eee5a9303d91 · 2021-08-30T08:37:24.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_598.java b/src/main/java/com/fishercoder/solutions/_598.java
@@ -3,6 +3,10 @@
 public class _598 {
 
     public static class Solution1 {
+        /**
+         * Since the incrementing starts from zero to op[0] and op[1], we only need to find the range that has the most overlaps.
+         * Thus we keep finding the minimum of both x and y.
+         */
         public int maxCount(int m, int n, int[][] ops) {
             int x = m;
             int y = n;
diff --git a/src/test/java/com/fishercoder/_598Test.java b/src/test/java/com/fishercoder/_598Test.java
@@ -0,0 +1,23 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._598;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _598Test {
+    private static _598.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _598.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(4, solution1.maxCount(3, 3, CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[2,2],[3,3]")));
+    }
+
+}
