304. Range Sum Query 2D
来源:互联网 发布:cda数据分析师协会 编辑:程序博客网 时间:2024/05/21 11:29
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.
public class NumMatrix {private int[][] dp; public NumMatrix(int[][] matrix) { if(matrix == null || matrix.length == 0 || matrix[0].length == 0) return; int m = matrix.length; int n = matrix[0].length; dp = new int[m+1][n+1]; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] + matrix[i-1][j-1]; } } } public int sumRegion(int row1, int col1, int row2, int col2) { return dp[row2 + 1][col2 + 1] - dp[row2 + 1][col1] - dp[row1][col2 + 1] + dp[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); */
0 0
- 303+304. Range Sum Query && Range Sum Query 2D
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable**
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D
- 304. Range Sum Query 2D
- 304. Range Sum Query 2D
- 304. Range Sum Query 2D
- 304. Range Sum Query 2D
- leetcode 304. Range Sum Query 2D
- 六龙争霸3D国战怎么玩 国战玩法详解
- [海盗分金] HDU 1538 A Puzzle for Pirates
- udhcp源码剖析(二)——DHCP服务器重要的数据结构
- USACO3.1 最短网络 Agri-Net(并查集)
- Spring Cloud构建微服务架构(六)高可用服务注册中心
- 304. Range Sum Query 2D
- SQL建表
- 1.PSTN与VoIP基础
- neo4j 图形数据库
- 怎样编写高质量的Java代码
- Arrays查找元素所在位置
- 打造前端MAC工作站(六)MAC上的压缩软件,keka和atool
- 小朋友排队 蓝桥杯
- Mybatis增删改查mapper文件写法