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).
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.
核心公式 sumMat[row1-1,col1-1]+sumMat[row2, col2]- sumMat[row1-1, col2] - sumMat[row2, col1-1];
public class NumMatrix
{
int[,] sumMat;
public NumMatrix(int[,] matrix)
{
int m = (int)matrix.GetLongLength(0);
int n = (int)matrix.GetLongLength(1);
sumMat = new int[m, n];
for (int i = 0; i < m; i++)
{
sumMat[i, 0] = matrix[i, 0];
for (int j = 1; j < n; j++)
{
sumMat[i, j] = sumMat[i, j - 1] + matrix[i, j];
}
}
for (int i = 1; i < m; i++)
{
for (int j = 0; j < n; j++)
{
sumMat[i, j] += sumMat[i - 1, j];
}
}
}
public int SumRegion(int row1, int col1, int row2, int col2)
{
if (row1 == 0 && col1 == 0)//初始位置为0,0
return sumMat[row2, col2];
if (row1 == 0 && col1 > 0)
return sumMat[row2, col2]- sumMat[row2, col1 - 1];
if (row1 > 0 && col1 == 0)
return sumMat[row2, col2] - sumMat[row1-1, col2];
return sumMat[row1-1,col1-1]+sumMat[row2, col2]- sumMat[row1-1, col2] - sumMat[row2, col1-1];
}
}
// Your NumMatrix object will be instantiated and called as such:
// NumMatrix numMatrix = new NumMatrix(matrix);
// numMatrix.SumRegion(0, 1, 2, 3);
// numMatrix.SumRegion(1, 2, 3, 4);
优化代码结构,添加辅助行和列,同时优化初始化方法
public class NumMatrix
{
int[,] sumMat;
public NumMatrix(int[,] matrix)
{
int m = (int)matrix.GetLongLength(0)+1;
int n = (int)matrix.GetLongLength(1)+1;
sumMat = new int[m, n];
for (int i = 1; i < m; i++)
{
for (int j = 1; j < n; j++)
{
sumMat[i, j] = matrix[i-1, j-1] + sumMat[i-1, j]+ sumMat[i, j-1]- sumMat[i - 1, j-1];
}
}
}
public int SumRegion(int row1, int col1, int row2, int col2)
{
return sumMat[row1,col1]+sumMat[row2+1, col2+1]- sumMat[row1, col2+1] - sumMat[row2+1, col1];
}
}