[Leetcode]Range Sum Query 2D - Immutable

Range Sum Query 2D - Immutable
Total Accepted: 4160 Total Submissions: 20469 Difficulty: Medium

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.

Subscribe to see which companies asked this question

因为从来没在构造函数里面写过return；导致第二次提交才对。。很久没有那种一次AC的快感了。
另外还有些疑问，如果直接在传入的矩阵里修改是可以允许的吗，在实际工程中不知道是怎么规定了。如果允许，那么空间复杂度就可以降为O(1)了。

class NumMatrix {
public:
    NumMatrix(vector<vector<int>> &matrix) {
        int m = matrix.size();
        if(m == 0)  return;// excited!
        int n = matrix[0].size();
        sumMatrix.resize(m,vector<int>(n,0));
        sumMatrix[0][0] = matrix[0][0];
        for(int i = 1;i <= m - 1;++ i){
            sumMatrix[i][0] = matrix[i][0] + sumMatrix[i - 1][0];
        }
        for(int j = 1;j <= n - 1;++ j){
            sumMatrix[0][j] = matrix[0][j] + sumMatrix[0][j - 1];
        }
        for(int i = 1;i <= m - 1;++ i){
            for(int j = 1;j <= n - 1;++ j){
                sumMatrix[i][j] = sumMatrix[i - 1][j] + sumMatrix[i][j - 1] + matrix[i][j] - sumMatrix[i - 1][j - 1];
            }
        }
    }

    int sumRegion(int row1, int col1, int row2, int col2) {
        if(row1 == 0 && col1 == 0){
            return sumMatrix[row2][col2];
        }
        else if(row1 == 0 && col1 != 0){
            return sumMatrix[row2][col2] - sumMatrix[row2][col1 - 1];
        }
        else if(row1 != 0 && col1 == 0){
            return sumMatrix[row2][col2] - sumMatrix[row1 - 1][col2];
        }
        else{
            return sumMatrix[row2][col2] - sumMatrix[row2][col1 - 1] - sumMatrix[row1 - 1][col2] + sumMatrix[row1 - 1][col1 - 1];
        }
    }
private:
    vector<vector<int> > sumMatrix;
};


// Your NumMatrix object will be instantiated and called as such:
// NumMatrix numMatrix(matrix);
// numMatrix.sumRegion(0, 1, 2, 3);
// numMatrix.sumRegion(1, 2, 3, 4);