难度:medium
思路:二维数组的前缀和,preSum[i][j] 存储闭区间 (0,0)到(i - 1,j - 1)的方框存储的数的和 ;
初始化preSum:
preSum[i][j] = preSum[i - 1][j] + preSum[i][j - 1] + matrix[i - 1][j - 1] - preSum[i - 1][j - 1]
计算区间:
preSum[row2 + 1][col2 + 1] + preSum[row1][col1] - preSum[row1][col2 + 1] -preSum[row2 + 1][col1]
注意:
preSum中不需要对row = 0和col - 0的情况进行初始化,从preSum的定义出发当i = 0或者j = 0,presum[i][j]是没有意义的;
代码:
class NumMatrix {
// 前缀和,preSum[i][j] 存储 闭区间(0,0)到(i - 1,j - 1)的方框存储的数的和
private int[][] preSum;
public NumMatrix(int[][] matrix) {
if (matrix.length == 0 || matrix[0].length == 0) {
return;
}
preSum = new int[matrix.length + 1][matrix[0].length + 1];
for (int i = 1; i < preSum.length; i++) {
for (int j = 1; j < preSum[0].length; j++) {
preSum[i][j] = preSum[i - 1][j] + preSum[i][j - 1] + matrix[i - 1][j - 1] - preSum[i - 1][j - 1];
}
}
}
public int sumRegion(int row1, int col1, int row2, int col2) {
return preSum[row2 + 1][col2 + 1] + preSum[row1][col1] - preSum[row1][col2 + 1] -preSum[row2 + 1][col1];
}
}
/**
* Your NumMatrix object will be instantiated and called as such:
* NumMatrix obj = new NumMatrix(matrix);
* int param_1 = obj.sumRegion(row1,col1,row2,col2);
*/
复杂度分析:
- 时间复杂度:初始化时为O(n^2),检索时为O(1)
- 空间复杂度:O(n)