题目描述
给定一个二维矩阵 matrix,以下类型的多个请求:
计算其子矩形范围内元素的总和,该子矩阵的左上角为 (row1, col1) ,右下角为 (row2, col2) 。
实现 NumMatrix 类:
NumMatrix(int[][] matrix) 给定整数矩阵 matrix 进行初始化
int sumRegion(int row1, int col1, int row2, int col2) 返回左上角 (row1, col1) 、右下角 (row2, col2) 的子矩阵的元素总和。
样例描述
输入:
["NumMatrix","sumRegion","sumRegion","sumRegion"]
[[[[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]]],[2,1,4,3],[1,1,2,2],[1,2,2,4]]
输出:
[null, 8, 11, 12]
解释:
NumMatrix numMatrix = new NumMatrix([[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]]]);
numMatrix.sumRegion(2, 1, 4, 3); // return 8 (红色矩形框的元素总和)
numMatrix.sumRegion(1, 1, 2, 2); // return 11 (绿色矩形框的元素总和)
numMatrix.sumRegion(1, 2, 2, 4); // return 12 (蓝色矩形框的元素总和)
思路
- 二维前缀和
容斥原理求中间的矩阵和
- 前缀和数组下标从1开始
- 求矩阵和的区域,由于边长也要算进和里面,所以得减一
代码
Java版:
class NumMatrix {
//二维前缀和
int s[][];
public NumMatrix(int[][] matrix) {
int m = matrix.length, n = matrix[0].length;
if (m == 0 || n == 0 || matrix == null) return;
s = new int[m + 1][n + 1];
//前缀和要从1开始
for (int i = 1; i <= m; i ++ ) {
for (int j = 1; j <= n; j ++ ) {
//最后加的matrix元素要减一,因为下标从0开始
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + matrix[i - 1][j - 1];
}
}
}
public int sumRegion(int x1, int y1, int x2, int y2) {
//前缀和从1开始,所以先加一
x1 ++;
y1 ++;
x2 ++;
y2 ++;
return s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1];
}
}
Python版:
class NumMatrix:
def __init__(self, matrix: List[List[int]]):
m , n = len(matrix), len(matrix[0])
if m == 0 or n == 0 or matrix == None:
return
self.snum = [[0] * (n + 1) for _ in range(m + 1)]
s = self.snum
for i in range(m) :
for j in range(n):
//前缀和从1开始的
s[i + 1][j + 1] = s[i][j + 1] + s[i + 1][j] - s[i][j] + matrix[i][j]
def sumRegion(self, x1: int, y1: int, x2: int, y2: int) -> int:
x1 += 1
y1 += 1
x2 += 1
y2 += 1
s = self.snum
return s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]