add test for 378

fishercoder1534 · fishercoder1534 · commit 2f77c8071d76 · 2021-07-07T07:54:45.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_378.java b/src/main/java/com/fishercoder/solutions/_378.java
@@ -28,7 +28,7 @@ public static class Solution2 {
          * end of row util we find the element is less than the mid, the left side element is all less than mid; keep tracking elements
          * that less than mid and compare with k, then update the k.
          */
-        public int kthSmallestBS(int[][] matrix, int k) {
+        public int kthSmallest(int[][] matrix, int k) {
             int row = matrix.length - 1;
             int col = matrix[0].length - 1;
             int lo = matrix[0][0];
diff --git a/src/test/java/com/fishercoder/_378Test.java b/src/test/java/com/fishercoder/_378Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._378;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _378Test {
+    private static _378.Solution1 solution1;
+    private static _378.Solution2 solution2;
+    private static int[][] matrix;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _378.Solution1();
+        solution2 = new _378.Solution2();
+    }
+
+    @Test
+    public void test1() {
+        matrix = new int[][]{
+                new int[]{-5}
+        };
+        assertEquals(-5, solution1.kthSmallest(matrix, 1));
+        assertEquals(-5, solution2.kthSmallest(matrix, 1));
+    }
+
+    @Test
+    public void test2() {
+        matrix = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2],[1,3]");
+        assertEquals(1, solution1.kthSmallest(matrix, 2));
+        assertEquals(1, solution2.kthSmallest(matrix, 2));
+    }
+
+}
