[leetcode]304. Range Sum Query 2D - Immutable二维区间求和 - 不变

Posted 程序媛詹妮弗

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[leetcode]304. Range Sum Query 2D - Immutable二维区间求和 - 不变相关的知识,希望对你有一定的参考价值。

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) -> 12

 

题目

给定元素不变的矩阵,求各种子矩阵和。

 

思路

 

代码

 


以上是关于[leetcode]304. Range Sum Query 2D - Immutable二维区间求和 - 不变的主要内容,如果未能解决你的问题,请参考以下文章

[leetcode]304. Range Sum Query 2D - Immutable二维区间求和 - 不变

leetcode 304. Range Sum Query 2D

[leetcode]304Range Sum Query 2D - Immutable动态规划计算二维数组中子数组的sum

304. Range Sum Query 2D - Immutable

304. Range Sum Query 2D - Immutable

算法: 求矩形框数字之和304. Range Sum Query 2D - Immutable