LeetCode动态规划专题：第十四天

思路总结

矩阵区域和的问题其实就是，二维前缀和的问题，记住二维前缀和的公式：
第一个公式是二维前缀和预处理公式：
sum[i][j] = f[i][j] + f[i-1][j] + f[i][j - 1] - f[i - 1][j - 1]
第二个公式是求区域和公式：以$r1,c1$为左上角，$r2,c2$为右下角的区域和公式为
sum[r2][c2] - sum[r1 - 1][c2] - sum[r2][c1 - 1] + sum[r1 - 1][c1 -1]

Leetcode1314. 矩阵区域和

思路：二维前缀和

class Solution {
public:
    int get(vector<vector<int>>& f, int n, int m, int x, int y) {
        x = max(min(n, x), 0);
        y = max(min(m, y), 0);
        return f[x][y];
    }
    vector<vector<int>> matrixBlockSum(vector<vector<int>>& mat, int k) {
        int n = mat.size(), m = mat[0].size();
        vector<vector<int>> f(n + 1, vector<int>(m + 1));
        for (int i = 1; i <= n; i ++ ) {
            for (int j = 1; j <= m; j ++ ) {
                f[i][j] += f[i - 1][j] + f[i][j - 1] + mat[i - 1][j - 1] - f[i - 1][j - 1];
            }
        }

        vector<vector<int>> ans(n, vector<int>(m));
        for (int i = 0; i < n; i ++ )
            for (int j = 0; j < m; j ++ ) {
                ans[i][j] = get(f, n, m, i + k + 1, j + k + 1) - get(f, n, m, i - k, j + k + 1) - get(f, n, m, i + k +1, j - k) + get(f, n, m, i - k, j - k);
            }
        return ans;
    }
};

Leetcode304. 二维区域和检索 - 矩阵不可变

class NumMatrix {
public:
    vector<vector<int>> f;
    NumMatrix(vector<vector<int>>& matrix) {
        int n = matrix.size(), m = matrix[0].size();
        f.resize(n + 1, vector<int>(m + 1));
        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= m; j ++ )
                f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1] + matrix[i - 1][j - 1];

    }
    
    int sumRegion(int r1, int c1, int r2, int c2) {
        return f[r2 + 1][c2 + 1] - f[r1][c2 + 1] - f[r2 + 1][c1] + f[r1][c1];
    }
};

/**
 * Your NumMatrix object will be instantiated and called as such:
 * NumMatrix* obj = new NumMatrix(matrix);
 * int param_1 = obj->sumRegion(row1,col1,row2,col2);
 */