力扣每日一题304 二维区域检索求和

给定一个二维矩阵，计算其子矩形范围内元素的总和，该子矩阵的左上角为 (row1, col1) ，右下角为 (row2, col2) 。
暴力法超时：

class NumMatrix {
    private: vector<vector<int>>dp;
public:
    NumMatrix(vector<vector<int>>& matrix) {
    if(matrix.size()==0||matrix[0].size()==0) return;
    
    for(int i=0;i<matrix.size();i++)
    {
        dp.push_back(matrix[i]);
    }
    }
    
    int sumRegion(int row1, int col1, int row2, int col2) {
    int sum=0;
    int col;
    while (row1<=row2)
    {
      col=col1;
      while(col1<=col2)
      {
       sum=sum+dp[row1][col1];
       col1++;
      }
      col1=col;
      row1++;
    }
    return sum;
    }
};

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

采用动态规划

class NumMatrix {
    private:vector<vector<int>>dp;
public:
    NumMatrix(vector<vector<int>>& matrix) {
    int m=matrix.size(); 
    if(m==0) return;
    int n=matrix[0].size();    
    dp.resize(m+1,vector<int>(n+1));
    for(int i=0;i<m;i++)
    {
        for(int j=0;j<n;j++)
        dp[i+1][j+1]=dp[i][j+1]+dp[i+1][j]-dp[i][j]+matrix[i][j];
    }   
    }
    
    int sumRegion(int row1, int col1, int row2, int col2) {
    return dp[row2+1][col2+1]-dp[row1][col2+1]-dp[row2+1][col1]+dp[row1][col1];
    }
};

转移方程： dp[i+1][j+1]=dp[i][j+1]+dp[i+1][j]-dp[i][j]+matrix[i][j];

求值公式：dp[row2+1][col2+1]-dp[row1][col2+1]-dp[row2+1][col1]+dp[row1][col1];