304. Range Sum Query 2D - Immutable

Given a 2D matrixmatrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1,col1) and lower right corner (row2,col2).

Range Sum Query 2D

The above rectangle (with the red border) is defined by (row1, col1) =(2, 1)and (row2, col2) =(4, 3), which contains sum =8.

Example:

Note:

  1. You may assume that the matrix does not change.

  2. There are many calls tosumRegion function.

  3. You may assume that row1 ≤ row2 and col1 ≤ col2.

Thoughts:

  1. Having a 2D dp arrays (m + 1, n + 1)

  2. When building: dp[i][i] = matrix[i -1][j-1] + dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] for i, j in [1,m] and [1,n]

  3. When calculating the query: res = dp[row2 + 1][col2 + 1] - dp[row2 + 1][col1] - dp[row1][col2 + 1] + dp[row1][col1]

  4. In Python: Initialize 2D list needs to be initialized as [[0] * m] for _ in range(n)) instead of [[0] * m]*n] since this would create n identical lists with the same reference.

Code

Last updated

Was this helpful?