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.
这里定义sums[i][j]是以[0,0]为左上角,以[i,j]为由下角的矩形的所有元素的和。
对第一行与第一列的sums的初始化,等于前一个sums加上当前的matrix元素。
对于sums[i,j]=
sums[i][j-1]+sums[i-1][j]-sums[i-1][j-1]+matrix[i][j];
因为五角星区域的元素重复两次加了。
在sumRange函数里求部分区域和时,思路相同,大的区域减去小的区域。要考虑重复减的,要再加上。
class NumMatrix {
public:
NumMatrix(vector<vector<int>> matrix) {
int m=matrix.size();
if(!m) return;
int n=matrix[0].size();
sums.resize(m);
for(int i=0;i<m;i++) sums[i].resize(n);
if(!n) return;
sums[0][0]=matrix[0][0];
//以下是初始化
for(int i=1;i<m;i++)
{
sums[i][0]=sums[i-1][0]+matrix[i][0];
}
for(int i=1;i<n;i++)
{
sums[0][i]=sums[0][i-1]+matrix[0][i];
}
for(int i=1;i<m;i++)
{
for(int j=1;j<n;j++)
sums[i][j]=sums[i][j-1]+sums[i-1][j]-sums[i-1][j-1]+matrix[i][j];
}
}
int sumRegion(int row1, int col1, int row2, int col2) {
if(row1==0&&col1==0)
return sums[row2][col2];
else if(row1==0)
return sums[row2][col2]-sums[row2][col1-1];
else if(col1==0)
return sums[row2][col2]-sums[row1-1][col2];
else return sums[row2][col2]-sums[row2][col1-1]-sums[row1-1][col2]+sums[row1-1][col1-1];
}
private:
vector<vector<int>> sums;
};
/**
* Your NumMatrix object will be instantiated and called as such:
* NumMatrix obj = new NumMatrix(matrix);
* int param_1 = obj.sumRegion(row1,col1,row2,col2);
*/