LeetCode *** 304. Range Sum Query 2D - Immutable
来源:互联网 发布:奔驰g63网络图片 编辑:程序博客网 时间:2024/05/18 18:17
题目:
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.
分析:
代码:
class NumMatrix { public: int** record; NumMatrix(vector<vector<int>> &matrix) { int m = matrix.size(),n; if (m) { n = matrix[0].size(); record = new int*[m]; for (int i = 0; i < m; ++i) record[i] = new int[n]; for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) record[i][j] = 0; for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) if (i == 0 && j == 0)record[i][j] = matrix[i][j]; else if (i == 0)record[i][j] = matrix[i][j] + record[i][j - 1]; else if (j == 0)record[i][j] = matrix[i][j] + record[i - 1][j]; else record[i][j] = matrix[i][j] + record[i][j - 1] + record[i - 1][j] - record[i - 1][j - 1]; } } int sumRegion(int row1, int col1, int row2, int col2) { if (!row1&&!col1)return record[row2][col2]; if (!row1)return record[row2][col2] - record[row2][col1 - 1]; if (!col1)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]; } };
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] 304. Range Sum Query 2D - Immutable 解题报告
- [leetcode] 304. Range Sum Query 2D - Immutable
- [leetcode] 304. Range Sum Query 2D - Immutable
- leetcode 304. Range Sum Query 2D - Immutable
- 304. Range Sum Query 2D - Immutable LeetCode
- 【剑指offer-Java版】02实现单例模式
- cisco路由器IPSECVPN之总部与一个分部通信配置
- Oracle 复合索引
- ceph存储 缓存淘汰算法--LRU算法
- Hibernate中的query.setFirstResult(),query.setMaxResults();
- LeetCode *** 304. Range Sum Query 2D - Immutable
- thinkphp3.23 新建新的模块
- windows7下制作苹果mac os x 10.10Yosemiteu盘启动盘
- 图像分割:Grabcut算法小程序
- Android开发-修改AVD路径
- svn服务器端回退版本
- Android Universal Image Loader学习笔记
- 找不到指定版本的API,failed to find Build Tools revision 23.0.0 rc2
- 【Vue】-(3) Vue与MVVM