feat: add typescript solution to lc problem: No.2428

No.2428.Maximum Sum of an Hourglass

Author: zhaocchen

solution/2400-2499/2428.Maximum Sum of an Hourglass/README.md

@@ -161,7 +161,22 @@ func max(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function maxSum(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    let threeSum = Array.from({ length: m }, () => new Array(n - 2).fill(0));
+    for (let i = 0; i < m; i++) {
+        for (let j = 1; j < n - 1; j++) {
+            threeSum[i][j - 1] = grid[i][j - 1] + grid[i][j] + grid[i][j + 1];
+        }
+    }
+    let ans = 0;
+    for (let i = 1; i < m - 1; i++) {
+        for (let j = 1; j < n - 1; j++) {
+            ans = Math.max(ans, threeSum[i - 1][j - 1] + grid[i][j] + threeSum[i + 1][j - 1]);
+        }
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2400-2499/2428.Maximum Sum of an Hourglass/README_EN.md

@@ -147,7 +147,22 @@ func max(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function maxSum(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    let threeSum = Array.from({ length: m }, () => new Array(n - 2).fill(0));
+    for (let i = 0; i < m; i++) {
+        for (let j = 1; j < n - 1; j++) {
+            threeSum[i][j - 1] = grid[i][j - 1] + grid[i][j] + grid[i][j + 1];
+        }
+    }
+    let ans = 0;
+    for (let i = 1; i < m - 1; i++) {
+        for (let j = 1; j < n - 1; j++) {
+            ans = Math.max(ans, threeSum[i - 1][j - 1] + grid[i][j] + threeSum[i + 1][j - 1]);
+        }
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2400-2499/2428.Maximum Sum of an Hourglass/Solution.ts

@@ -0,0 +1,16 @@
+function maxSum(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    let threeSum = Array.from({ length: m }, () => new Array(n - 2).fill(0));
+    for (let i = 0; i < m; i++) {
+        for (let j = 1; j < n - 1; j++) {
+            threeSum[i][j - 1] = grid[i][j - 1] + grid[i][j] + grid[i][j + 1];
+        }
+    }
+    let ans = 0;
+    for (let i = 1; i < m - 1; i++) {
+        for (let j = 1; j < n - 1; j++) {
+            ans = Math.max(ans, threeSum[i - 1][j - 1] + grid[i][j] + threeSum[i + 1][j - 1]);
+        }
+    }
+    return ans;
+};