[Leetcode] Range Sum Query 2D - Immutable
来源:互联网 发布:网络与系统攻击技术 编辑:程序博客网 时间:2024/05/01 01:34
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 { int[][] record; public NumMatrix(int[][] matrix) { if(matrix == null || matrix.length == 0 || matrix[0].length == 0) { return; } record = new int[matrix.length][matrix[0].length]; for(int i = 0; i < matrix.length; i++) { int rowSum = 0; for(int j = 0; j < matrix[0].length; j++) { rowSum += matrix[i][j]; if(i == 0) { record[i][j] = rowSum; } else { record[i][j] = record[i-1][j] + rowSum; } } } } public int sumRegion(int row1, int col1, int row2, int col2) { if(row1 == 0 && col1 == 0) { return record[row2][col2]; } if(row1 == 0) { return record[row2][col2] - record[row2][col1 - 1]; } if(col1 == 0) { return record[row2][col2] - record[row1 - 1][col2]; } return record[row2][col2] - record[row1 - 1][col2] - record[row2][col1 - 1] + record[row1 - 1][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);
0 0
- [Leetcode]Range Sum Query 2D - Immutable
- Leetcode Range Sum Query 2D - Immutable
- LeetCode Range Sum Query 2D - Immutable
- [Leetcode]Range Sum Query 2D - Immutable
- Leetcode Range Sum Query 2D - Immutable
- Leetcode: Range Sum Query 2D - Immutable
- Leetcode: Range Sum Query 2D - Immutable
- leetcode:Range Sum Query 2D - Immutable
- LeetCode|Range Sum Query 2D - Immutable
- 【Leetcode】Range Sum Query 2D - Immutable
- [Leetcode] Range Sum Query 2D - Immutable
- [LeetCode]Range Sum Query 2D - Immutable
- LeetCode -- Range Sum Query 2D - Immutable
- LeetCode Range Sum Query - Immutable & Range Sum Query 2D - Immutable
- [leetcode-304]Range Sum Query 2D - Immutable(java)
- [leetcode-304]Range Sum Query 2D - Immutable
- LeetCode 题解(287): Range Sum Query 2D - Immutable
- Range Sum Query 2D - Immutable My Submissionsstion-leetcode
- java排序之插入排序
- dSYM,app,crash 文件 UUID 匹配
- android recycleView使用总结
- 从零开始学 Java – Spring MVC 统一异常处理
- 并发队列处理 之 MSMQ
- [Leetcode] Range Sum Query 2D - Immutable
- 子元素的margin-top值会使父元素也出现margin-top值问题
- xcode8 升级后部分电脑注释快捷键不能使用的解决方法
- 有关minSdkVersion和targetSdkVersion
- 通过JDBC获取数据库连接
- KK版本手机没有外置T卡卡座,如何去掉外置T卡
- subversion edge
- 十四章上机练习4
- 将bitmap生成圆角