add a solution for 1380

Author: fishercoder1534

Diff for: src/main/java/com/fishercoder/solutions/secondthousand/_1380.java

@@ -37,4 +37,36 @@ private boolean luckyInRow(int number, int[] row) {
             return true;
         }
     }
+
+    public static class Solution2 {
+        public List<Integer> luckyNumbers(int[][] matrix) {
+            List<Integer> rowMins = new ArrayList<>();
+            for (int i = 0; i < matrix.length; i++) {
+                int j = 0;
+                int rowMin = matrix[i][j++];
+                for (; j < matrix[0].length; j++) {
+                    rowMin = Math.min(rowMin, matrix[i][j]);
+                }
+                rowMins.add(rowMin);
+            }
+            List<Integer> colMaxs = new ArrayList<>();
+            for (int j = 0; j < matrix[0].length; j++) {
+                int i = 0;
+                int colMax = matrix[i++][j];
+                for (; i < matrix.length; i++) {
+                    colMax = Math.max(colMax, matrix[i][j]);
+                }
+                colMaxs.add(colMax);
+            }
+            List<Integer> result = new ArrayList<>();
+            for (int i = 0; i < matrix.length; i++) {
+                for (int j = 0; j < matrix[0].length; j++) {
+                    if (matrix[i][j] == rowMins.get(i) && matrix[i][j] == colMaxs.get(j)) {
+                        result.add(matrix[i][j]);
+                    }
+                }
+            }
+            return result;
+        }
+    }
 }

Diff for: src/test/java/com/fishercoder/secondthousand/_1380Test.java

@@ -1,20 +1,23 @@
 package com.fishercoder.secondthousand;
 
 import com.fishercoder.solutions.secondthousand._1380;
-import org.junit.BeforeClass;
-import org.junit.Test;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
 
 import java.util.Arrays;
 
-import static org.junit.Assert.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 
 public class _1380Test {
     private static _1380.Solution1 solution1;
+    private static _1380.Solution2 solution2;
     private static int[][] matrix;
 
-    @BeforeClass
-    public static void setup() {
+    @BeforeEach
+    public void setup() {
         solution1 = new _1380.Solution1();
+        solution2 = new _1380.Solution2();
     }
 
     @Test
@@ -25,6 +28,7 @@ public void test1() {
                 {15, 16, 17}
         };
         assertEquals(Arrays.asList(15), solution1.luckyNumbers(matrix));
+        assertEquals(Arrays.asList(15), solution2.luckyNumbers(matrix));
     }
 
 }