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.
题意:给出一个整数型的二维数组,然后多次请求指定区域的值。
思路:
从(0,0)到(n,n)逐行逐列遍历,用二维数组sum[row][col]记下当前位置到(0,0)的累加和,方法如下表所示:
绿色位置(2,2)到(0,0)的累计和sum[2][2] = sum[2][1] (蓝色区域) + sum[1][2] (粉色区域) - sum[1][1] (黄色区域) + matrix[2,2](自身的数值)。
ps:减去黄色区域的值的原因是蓝色区域(2,1)到(0,0)和粉色区域(1,2)到(0,0)包含了两次黄色区域(1,1)到(0,0)的累加和。
要求(2,2),(5,5)之间区域的累加和时,只用减去下表所示中指定区域边界的左边、上边、左上方的值即可:
区域间的累加和rectSum = sum[5][5] - sum[1][5] - sum[5][1] + sum[1][1]
ps:加上黄色区域的值的原因是蓝色和粉色减去了两次黄色区域的值。
代码:(添加的第一行第一列都为0的原因是免除判断越界的问题)
class NumMatrix {
int[][] sum= null;
public NumMatrix(int[][] matrix) {
int rows = matrix.length;
int cols = (rows==0 ? 0 : matrix[0].length);
sum = new int[rows+1][cols+1];
for(int i=1;i<=rows;i++){
for(int j=1;j<=cols;j++){
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + matrix[i-1][j-1];
}
}
}
public int sumRegion(int row1, int col1, int row2, int col2) {
return sum[row2+1][col2+1] - sum[row2+1][col1] - sum[row1][col2+1] + sum[row1][col1];
}
}