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.
这道题是第303题的升级版,查询区间从一维升级到了二维,题目难度为Medium。
根据第303题的经验,我们依旧采用动态规划的方法存储当前坐标左上角矩形中的数字之和,这样根据给出的两个坐标确定矩形顶点,再根据矩形顶点位置的数字之和即可计算出最终结果。举个栗子,假定给定的两个坐标是(1,3)和(2,4),这样确定出矩形的四个顶点分别是(1,3),(1,4),(2,3),(2,4),这样用Sum(2,4) - Sum(2,3) - Sum(1,4) + Sum(1,3)即得到了区间内的数据之和。具体代码:
class NumMatrix {
vector<vector<int>> curSum;
public:
NumMatrix(vector<vector<int>> &matrix) {
if(matrix.size() && matrix[0].size()) {
curSum.assign(matrix.begin(), matrix.end());
for(int i=1; i<matrix.size(); i++) curSum[i][0] += curSum[i-1][0];
for(int i=1; i<matrix[0].size(); i++) curSum[0][i] += curSum[0][i-1];
for(int i=1; i<matrix.size(); i++) {
for(int j=1; j<matrix[0].size(); j++) {
curSum[i][j] += curSum[i-1][j];
curSum[i][j] += curSum[i][j-1];
curSum[i][j] -= curSum[i-1][j-1];
}
}
}
}
int sumRegion(int row1, int col1, int row2, int col2) {
int ret = curSum[row2][col2];
if(row1 > 0) ret -= curSum[row1-1][col2];
if(col1 > 0) ret -= curSum[row2][col1-1];
if(row1>0 && col1>0) ret += curSum[row1-1][col1-1];
return ret;
}
};