leetcode 304.Range Sum Query 2D - Immutable

Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).

The above rectangle (with the red border) is defined by (row1, col1) = (2, 1) and (row2, col2) = (4, 3), which contains sum = 8.

Example:
Given matrix = [
[3, 0, 1, 4, 2],
[5, 6, 3, 2, 1],
[1, 2, 0, 1, 5],
[4, 1, 0, 1, 7],
[1, 0, 3, 0, 5]
]

sumRegion(2, 1, 4, 3) -> 8
sumRegion(1, 1, 2, 2) -> 11
sumRegion(1, 2, 2, 4) -> 12
Note:
You may assume that the matrix does not change.
There are many calls to sumRegion function.
You may assume that row1 ≤ row2 and col1 ≤ col2.

这道题要求题目给出矩阵的数值和所要求的矩阵的左上和右下点，求在区域范围里面的矩阵值的总和。

先看一下题目给的接口：

class NumMatrix {
public:
    NumMatrix(vector<vector<int>> matrix) {

    }

    int sumRegion(int row1, int col1, int row2, int col2) {

    }
};

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

可以看出如果每次都对矩阵重新求一次值，每次都是O(mn)的复杂度，明显超时。所以，要求出一个sum矩阵，使得结果利用sum矩阵达到复杂度O(1)。所以sum矩阵要使用到动态规划，那么sum矩阵如何构建：
动态规划的要素还是不能缺：
1. 初始化：对矩阵的sum(0,:)和sum(:,0)就是最上面和最左边的行和列全都初始化为0.
2. 递推公式：

结果代码如下：

class NumMatrix {
private:
    int row,col;
    vector<vector<int>> sum;
public:
    NumMatrix(vector<vector<int>> matrix) {
        if(matrix.empty())
        {
            sum.push_back(vector<int>(1,0));
            return;
        }
        row=matrix.size();
        col=matrix[0].size();
        sum=vector<vector<int>>(row+1,vector<int>(col+1,0));
        for(int i=1;i<row+1;++i)
        {
            for(int j=1;j<col+1;++j)
            {
                sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+matrix[i-1][j-1];
            }
        }
    }

    int sumRegion(int row1, int col1, int row2, int col2) {
        return sum[row2+1][col2+1]-sum[row2+1][col1]-sum[row1][col2+1]+sum[row1][col1];        
    }
};

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