class NumMatrix:
def __init__(self, matrix: List[List[int]]):
if not matrix or not matrix[0]:pass
else:
row = len(matrix)
col = len(matrix[0])
# 初始化行列都为0,且row+1,col+1
self.dp = [[ 0 ] * (col + 1) for _ in range(row + 1)]
# 求行的前缀和
for i in range(1, row + 1):
for j in range(1 ,col + 1):
self.dp[i][j] = self.dp[i][j - 1] + matrix[i - 1][j - 1]
# 求列的前缀和
for j in range(1, col + 1):
for i in range(1, row + 1):
self.dp[i][j] += self.dp[i - 1][j]
# 上面可以直接简写成如下
"""
for i in range(1, row + 1):
for j in range(1, col + 1):
self.dp[i][j] = matrix[i - 1][j - 1] + self.dp[i - 1][j] + self.dp[i][j - 1] - self.dp[i-1][j-1]
"""
def sumRegion(self, row1: int, col1: int, row2: int, col2: int) -> int:
return self.dp[row2 + 1][col2 + 1] - self.dp[row1][col2 + 1] - self.dp[row2 + 1][col1] + self.dp[row1][col1]
# Your NumMatrix object will be instantiated and called as such:
# obj = NumMatrix(matrix)
# param_1 = obj.sumRegion(row1,col1,row2,col2)
解析:
是3.1前缀和维度的升级,先求行,列的前缀和得到数组中元素左上角的所有元素的和,再利用所得的新数组进行运算处理。
作者:powcai
链接:链接
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。