304. Range Sum Query 2D - Immutable**
来源:互联网 发布:复杂网络数据集 编辑:程序博客网 时间:2024/06/05 07:43
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) -> 8sumRegion(1, 1, 2, 2) -> 11sumRegion(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) { int iMin = Math.min(row1, row2); int iMax = Math.max(row1, row2); int jMin = Math.min(col1, col2); int jMax = Math.max(col1, col2); return dp[iMax + 1][jMax + 1] - dp[iMax + 1][jMin] - dp[iMin][jMax + 1] + dp[iMin][jMin]; }}/** * 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
- 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
- Range Sum Query 2D - Immutable
- Range Sum Query 2D - Immutable
- [Leetcode]Range Sum Query 2D - Immutable
- Range Sum Query 2D - Immutable
- Leetcode Range Sum Query 2D - Immutable
- LeetCode Range Sum Query 2D - Immutable
- [Leetcode]Range Sum Query 2D - Immutable
- 翻译《有关编程、重构及其他的终极问题?》——15.在你的代码中开始使用enum class吧
- 电车
- Python Study Note 1
- 字符串反转源码
- 转载:解决安装xilinx-2011.09-50-arm-xilinx-linux-gnueabi.bin时出现的strings: '/lib/libc.so.6': No such file的问题
- 304. Range Sum Query 2D - Immutable**
- Makefile 中:= ?= += =的区别
- 【USACO1.5】回文质数 Prime Palindromes
- [netty]-消息编解码之Java原生序列化
- Hibernate流程解析
- 历届试题 兰顿蚂蚁
- 36、乘法
- 307. Range Sum Query - Mutable**
- Win7系统使用--Win7无法连接wifi问题的解决方法