[Leetcode] 308. Range Sum Query 2D - Mutable 解题报告

题目：

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
update(3, 2, 2)
sumRegion(2, 1, 4, 3) -> 10

Note:

1. The matrix is only modifiable by the update function.
2. You may assume the number of calls to update and sumRegion function is distributed evenly.
3. You may assume that row1 ≤ row2 and col1 ≤ col2.

思路：

和Leetcode 307的思路完全一样，二维矩阵完全可以被看成m个一维的情况。对于每一个一维的情况，我们完全可以借用Leetcode 307的思路和代码，也就可以采用线段树和二分索引树这两种数据结构。为了简便，我们这里仅仅给出二分索引树的代码。

代码：

class NumMatrix {
public:
    NumMatrix(vector<vector<int>> matrix) {
        if(matrix.size() == 0 || matrix[0].size() == 0) {   // the time complexity is O(mnlogn)
            return;
        }
        vec = matrix;
        int m = matrix.size(), n = matrix[0].size();
        sum.resize(m, vector<int>(n + 1, 0));               // In BIT, the index is from 1 to n, not from 0 - (n-1)
        for(int i = 0; i < m; ++i) {
            for(int j = 0; j < n; ++j) {
                add(matrix[i][j], i, j + 1);
            }
        }
    }

    void update(int row, int col, int val) {                // the time complexity is O(logn)
        int d = val - vec[row][col];
        vec[row][col] = val;
        add(d, row, col + 1);
    }

    int sumRegion(int row1, int col1, int row2, int col2) { // the time complexity is O(mlogn)
        int ans = 0;
        for(int i = row1; i <= row2; ++i) { {
            ans += getSum(i, col2 + 1) - getSum(i, col1);
        }
        return ans;
    }
private:
    void add(int val, int x, int y) {                       // the time complexity is O(logn)
        while(y < sum[x].size()) {
            sum[x][y] += val;
            y += (y & -y);
        }
    }
    
    int getSum(int x, int y) {                              // the time complexity is O(logn)
        int ans = 0;
        while(y > 0) {
            ans += sum[x][y];
            y -= (y & -y);
        }
        return ans;
    }
    vector<vector<int>> sum;
    vector<vector<int>> vec;
};


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