- Range Sum Query 2D - Immutable
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).
Range Sum Query 2D
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.
dp有时候创建长度+1的数组会减少边界判定的复杂度
type NumMatrix struct {
Data [][]int
Sum [][]int
}
func Constructor(matrix [][]int) NumMatrix {
d := NumMatrix{Data: matrix, Sum: make([][]int, len(matrix)+1)}
if len(matrix) == 0 || len(matrix[0]) == 0 {
return d
}
d.Sum[0]= make([]int, len(matrix[0])+1)
for i := 1; i <= len(matrix); i++ {
d.Sum[i] = make([]int, len(matrix[0])+1)
for j := 1; j <= len(matrix[0]); j++ {
d.Sum[i][j] = d.Sum[i-1][j] + d.Sum[i][j-1] - d.Sum[i-1][j-1] + d.Data[i-1][j-1]
}
}
return d
}
func (this *NumMatrix) SumRegion(row1 int, col1 int, row2 int, col2 int) int {
return this.Sum[row2+1][col2+1] - this.Sum[row1][col2+1] - this.Sum[row2+1][col1] + this.Sum[row1][col1]
}