add 2373

Author: fishercoder1534

Diff for: README.md

@@ -54,6 +54,7 @@ _If you like this project, please leave me a star._ ★
 | 2395 |[Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2395.java)                                                                     || Easy                                                                          ||
 | 2380 |[Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2380.java)                                                                     || Medium                                                                        ||
 | 2379 |[Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2379.java)                                                                     || Easy                                                                          ||
+| 2373 |[Largest Local Values in a Matrix](https://leetcode.com/problems/largest-local-values-in-a-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2373.java)                                                                     || Easy                                                                          ||
 | 2367 |[Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2367.java)                                                                     || Easy                                                                          ||
 | 2363 |[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2363.java)                                                                     || Easy                                                                          ||
 | 2357 |[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2357.java)                                                                     || Easy                                                                          ||

Diff for: src/main/java/com/fishercoder/solutions/_2373.java

@@ -0,0 +1,20 @@
+package com.fishercoder.solutions;
+
+public class _2373 {
+    public static class Solution1 {
+        public int[][] largestLocal(int[][] grid) {
+            int m = grid.length;
+            int[][] result = new int[m - 2][m - 2];
+            for (int i = 0; i < m - 2; i++) {
+                for (int j = 0; j < m - 2; j++) {
+                    for (int ii = i; ii <= i + 2; ii++) {
+                        for (int jj = j; jj <= j + 2; jj++) {
+                            result[i][j] = Math.max(result[i][j], grid[ii][jj]);
+                        }
+                    }
+                }
+            }
+            return result;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/_2373Test.java

@@ -0,0 +1,34 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2373;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+public class _2373Test {
+
+    private static _2373.Solution1 solution1;
+    private static int[][] grid;
+    private static int[][] expected;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2373.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        grid = new int[][]{
+                {9, 9, 8, 1},
+                {5, 6, 2, 6},
+                {8, 2, 6, 4},
+                {6, 2, 2, 2}
+        };
+        expected = new int[][]{
+                {9, 9},
+                {8, 6}
+        };
+        assertArrayEquals(expected, solution1.largestLocal(grid));
+    }
+}