[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二维区间求和 - 不变

原文：https://www.cnblogs.com/liuliu5151/p/9841057.html