Leetcode 304. Range Sum Query 2D - Immutable

Problem

Given a 2D matrix matrix, handle multiple queries of the following type:

  • Calculate the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).

Implement the NumMatrix class:

  • NumMatrix(int[][] matrix) Initializes the object with the integer matrix matrix.
  • int sumRegion(int row1, int col1, int row2, int col2) Returns the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).

You must design an algorithm where sumRegion works on O(1) time complexity.

Algorithm

Dynamics Programming (DP). Calculate the sum from (0, 0) to (r, c). sum(row1, col1, row2, col2) = sum(0, 0, row2, col2) - sum(0, 0, row1-1, col2) - sum(0, 0, row2, col1-1) + sum(0, 0, row1-1, col1-1).

Code

class NumMatrix:

    def __init__(self, matrix: List[List[int]]):
        self._row = len(matrix) + 1     
        self._col = len(matrix[0]) + 1
        self._sum = [ [0] * self._col for i in range(self._row)]
        # calculate sum(0, 0, r, c)
        for _r in range(1, self._row):
            self._sum[_r][1] = self._sum[_r-1][1] + matrix[_r-1][0]
        for _c in range(1, self._col):
            self._sum[1][_c] = self._sum[1][_c-1] + matrix[0][_c-1]
        for _r in range(1, self._row):
            for _c in range(1, self._col):
                self._sum[_r][_c] = self._sum[_r][_c-1] + self._sum[_r-1][_c] - self._sum[_r-1][_c-1] + matrix[_r-1][_c-1]
        

    def sumRegion(self, row1: int, col1: int, row2: int, col2: int) -> int:
        row1 += 1 
        if row1 < 0: row1 = 0
        col1 += 1 
        if col1 < 0: col1 = 0
        row2 += 1 
        if row2 >= self._row: row2 = self._row
        col2 += 1 
        if col2 >= self._col: col2 = self._col
        return self._sum[row2][col2] - self._sum[row1-1][col2] - self._sum[row2][col1-1] + self._sum[row1-1][col1-1]


# Your NumMatrix object will be instantiated and called as such:
# obj = NumMatrix(matrix)
# param_1 = obj.sumRegion(row1,col1,row2,col2)
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值