leetcode 304 : Range Sum Query 2D - Immutable

1、原题如下：

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.\

2、解题如下：

class NumMatrix {
public:
    NumMatrix(vector<vector<int>> &matrix) {
        acmatrix=matrix;
        for(int i=0;i<matrix.size();i++)
        {
            for(int j=0;j<matrix[0].size();j++)
            {
                acmatrix[i][j]+=tmp(i-1,j)+tmp(i,j-1)-tmp(i-1,j-1);
            }
        }
    }

    int sumRegion(int row1, int col1, int row2, int col2) {
        return tmp(row2,col2)+tmp(row1-1,col1-1)-tmp(row1-1,col2)-tmp(row2,col1-1);
    }
private:
    vector<vector<int>> acmatrix;
    int tmp(int a,int b){return (a<0||b<0)?0:acmatrix[a][b];}
};

3、总结
本题有一个关键点就是matrix[0]是否存在；如果按照如下改下程序则有问题

int m=matrix.size();
int n=matrix[0].size();
for(int i=0;i<m;i++)
    for(int j=0;j<n;j++)

原因就在于此，一旦不满足for循环的第一次判断，就不会进入子for循环，也就规避了这个问题，但是直接写matrix[0]会因为不存在而报错。