leetcode

0 class Solution {

1 public:

2 int maxSum(const vector<vector<int>> &grid) {

3 int m = grid.size(), n = grid[0].size(), res = 0;

4 for (int i = 0; i < m - 2; ++i) {

5 for (int j = 0; j < n - 2; ++j)

6 res = max(res, grid[i + 0][j] + grid[i + 0][j + 1] + grid[i + 0][j + 2] + grid[i + 1][j + 1] +

7 grid[i + 2][j] + grid[i + 2][j + 1] + grid[i + 2][j + 2]);

8 }

9 return res;

10 }

11 };