(LeetCode 304) Range Sum Query 2D - Immutable

Q:
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).

Range Sum Query 2D
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.

题意就是输入一个二维数组，然后输出给定下标$（row1,col1）（row2,col2）$之间矩形区域的值的和。

solution:
这道题与上一题思路一样，先求得$[0-i][0-j]$所有值的和并存储在数组$sums[i][j]$中所以就会有以下递推公式：
$sums[i][j] = sums[i-1][j]+sums[i][j-1]+matrix[i][j]-sums[i-1][j-1];$

对于$(row1,col1)$到$(row2,col2)$之间的数之和为：
$sums[row2][col2]-sums[row2][col1-1]-sums[row1-1][col2]+sums[row1-1][col1-1]$。

通过这道题，我知道了嵌套的vector可以当做二维数组通过二维下标，直接取数。并且，通过所有下标加1可以省去很多的条件判断，下面提供两个版本的代码，大家可以感受一下。
下面是所有下标加1之后的代码：

class NumMatrix {
public:
 NumMatrix(vector<vector<int>> &matrix) {
     if(matrix.empty())return ;
        sums = new int*[matrix.size()+1];
        for(int k=0; k<matrix.size()+1; k++){
            sums[k] = new int[matrix[0].size()+1];
        }

        for(int i=0; i<matrix.size(); i++){
            for(int j=0; j<matrix[0].size(); j++){
                sums[i+1][j+1] = sums[i][j+1]+sums[i+1][j]+matrix[i][j]-sums[i][j];
            }
        }
    }

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

可以省去很多条件判断！
这是所有下标没有加1的代码，但是运行效率会有所提升：

class NumMatrix {
public:
 NumMatrix(vector<vector<int>> &matrix) {
        sums = new int*[matrix.size()];
        int sum=0;
        for(int i=0; i<matrix.size(); i++){
            vector<int> temp = matrix[i];
            sums[i] = new int[matrix[0].size()];
            for(int j=0; j<temp.size(); j++){
                if(i==0){
                    sum+=temp[j];
                    sums[i][j]=sum;
                }
                else if(j==0)sums[i][j]=sums[i-1][j]+temp[j];
                else sums[i][j]=sums[i-1][j]+sums[i][j-1]+temp[j]-sums[i-1][j-1];
            }
        }
    }

    int sumRegion(int row1, int col1, int row2, int col2) {
        if(row1==0&&col1==0)return sums[row2][col2];
        if(row1==0)return sums[row2][col2]-sums[row2][col1-1];
        if(col1==0)return sums[row2][col2]-sums[row1-1][col2];
        return sums[row2][col2]-sums[row2][col1-1]-sums[row1-1][col2]+sums[row1-1][col1-1];
    }
    int **sums;
};