304. Range Sum Query 2D - Immutable(二维范围和查询——恒定)
题目链接
https://leetcode.com/problems/range-sum-query-2d-immutable/description/
题目描述
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) -> 12Note:
1. You may assume that the matrix does not change.
2. There are many calls to sumRegion function.
3. You may assume that row1 ≤ row2 and col1 ≤ col2.
题目分析
这道题目是一道很简单的动态规划,定义sum矩阵:sum[i][j] = sumRegion(0, 0, i, j)
这样可以轻易得到状态转移方程:
sum[i][j] = sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1] + matrix[i][j]
对于所求的和可以直接通过sum矩阵求得:
sumRegion(row1, col2, row2, col2) = sum[row2][col2] - sum[row2][col1 - 1] - sum[row1 - 1][col2] + sum[row1 - 1][col1 - 1]
注意:
这道题目所给的矩阵可能为空,注意判断即可
方法:动态规划
算法描述
- 遍历matrix矩阵,利用上面所给的状态转移方程,构造sum矩阵
- 利用sum矩阵,直接算出所求的区域和
参考代码
class NumMatrix {
private:
vector<vector<int>> sum;
public:
NumMatrix(vector<vector<int>> matrix) {
if (!matrix.empty()) {
sum = vector<vector<int>>(matrix.size() + 1, vector<int>(matrix[0].size() + 1, 0));
for (int i = 0; i < matrix.size(); i++)
for (int j = 0; j < matrix[0].size(); j++) {
sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + matrix[i][j];
}
}
}
int sumRegion(int row1, int col1, int row2, int col2) {
return sum[row2 + 1][col2 + 1] - sum[row1][col2 + 1] - sum[row2 + 1][col1] + sum[row1][col1];
}
};
/**
* Your NumMatrix object will be instantiated and called as such:
* NumMatrix obj = new NumMatrix(matrix);
* int param_1 = obj.sumRegion(row1,col1,row2,col2);
*/