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

解法：动态规划

class NumMatrix {
private:
    vector<vector<int>> dp;	//dp数组比matrix多一圈为0
public:
    NumMatrix(vector<vector<int>>& matrix) {
        if(matrix.empty() || matrix[0].empty())  return;
        dp=vector<vector<int>>(matrix.size()+1, vector<int>(matrix[0].size()+1));
        for(int i=0;i<matrix.size();i++){
            for(int j=0;j<matrix[0].size();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][col1]-dp[row2+1][col1]-dp[row1][col2+1];    
    }
};