308. Range Sum Query 2D - Mutable

最新推荐文章于 2022-04-02 10:14:39 发布

BigFatSheep

最新推荐文章于 2022-04-02 10:14:39 发布

阅读量228

点赞数

分类专栏： Leetcode Hard

本文链接：https://blog.csdn.net/BigFatSheep/article/details/83730103

版权

Leetcode 同时被 2 个专栏收录

385 篇文章 0 订阅

订阅专栏

Hard

51 篇文章 0 订阅

订阅专栏

Description

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

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:
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
update(3, 2, 2)
sumRegion(2, 1, 4, 3) -> 10
Note:
The matrix is only modifiable by the update function.
You may assume the number of calls to update and sumRegion function is distributed evenly.
You may assume that row1 ≤ row2 and col1 ≤ col2.

Problem URL

Solution

给一个二维数组，要求能够计算围成的长方形内部的所有数的和。

Maintaining a two-dimensional array which contains the sum of this column till now. When update, count the difference and then apply them to this col’s tail. When search, count the result column by column.

Code

class NumMatrix {
    private int[][] matrix;
    private int[][] colSums;
    public NumMatrix(int[][] matrix) {
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0){
            return;
        }
        this.matrix = matrix;
        int m = matrix.length, n = matrix[0].length;
        colSums = new int[m + 1][n];
        for (int i = 1; i <= m; i++){
            for (int j = 0; j < n; j++){
                colSums[i][j] = colSums[i - 1][j] + matrix[i - 1][j];
            }
        }
    }
    
    public void update(int row, int col, int val) {
        int diff = val - matrix[row][col];
        matrix[row][col] = val;
        for (int i = row + 1; i < colSums.length; i++){
            colSums[i][col] += diff;
        }
    }
    
    public int sumRegion(int row1, int col1, int row2, int col2) {
        int res = 0;
        for (int i = col1; i <= col2; i++){
            res += (colSums[row2 + 1][i] - colSums[row1][i]);
        }
        return res;
    }
}

/**
 * Your NumMatrix object will be instantiated and called as such:
 * NumMatrix obj = new NumMatrix(matrix);
 * obj.update(row,col,val);
 * int param_2 = obj.sumRegion(row1,col1,row2,col2);
 */