304. 二维区域和检索 - 矩阵不可变(java求解)
题目描述: 给定一个二维矩阵,计算其子矩形范围内元素的总和,该子矩阵的左上角为 (row1, col1) ,右下角为 (row2, col2) 。
示例:
给定 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
class NumMatrix {
int sum [][];
public NumMatrix(int[][] matrix) {
int m = matrix.length;
if(m>0){
int n = matrix[0].length;
sum = new int[m][n+1];
for (int i = 0 ; i < m ; i++){
for(int j = 0 ; j < n ; j++){
sum[i][j+1] = sum[i][j] + matrix[i][j]; //计算数组的前缀和,方便后续计算
}
}
}
}
public int sumRegion(int row1, int col1, int row2, int col2) {
int total = 0;
for (int i = row1; i <= row2 ; i++){
total+= sum[i][col2+1] - sum[i][col1];
}
return total;
}
}