LeetCode 308. Range Sum Query 2D

原题链接在这里：https://leetcode.com/problems/range-sum-query-2d-mutable/

题目：

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

update(3, 2, 2)

sumRegion(2, 1, 4, 3) -> 10

题解：

用到了二维binary index tree.

Time Complexity: builder O(mnlogmn). update O(logmn). sumRange O(logmn). m = matrix.length. n = matrix[0].length.

Space : O(mn).

AC Java:

 public class NumMatrix {

     int [][] bit;

     int [][] matrix;

     public NumMatrix(int[][] matrix) {

         if(matrix == null || matrix.length == 0 || matrix[0].length == 0){

             return;

         }

         int m = matrix.length;

         int n = matrix[0].length;

         this.bit = new int[m+1][n+1];

         this.matrix = new int[m][n];

         for(int i = 0; i<m; i++){

             for(int j = 0; j<n; j++){

                 update(i, j, matrix[i][j]);

             }

         }

     }

     public void update(int row, int col, int val) {

         int diff = val - this.matrix[row][col];

         this.matrix[row][col] = val;

         for(int i = row+1; i<bit.length; i+=(i&-i)){

             for(int j = col+1; j<bit[0].length; j+=(j&-j)){

                 this.bit[i][j] += diff;

             }

         }

     }

     public int sumRegion(int row1, int col1, int row2, int col2) {

         return getSum(row2+1, col2+1) - getSum(row1, col2+1) - getSum(row2+1, col1) + getSum(row1, col1);

     }

     private int getSum(int row, int col){

         int sum = 0;

         for(int i = row; i>0; i-=(i&-i)){

             for(int j = col; j>0; j-=(j&-j)){

                 sum += this.bit[i][j];

             }

         }

         return sum;

     }

 }

 /**

  * 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);

  */

类似Range Sum Query - Mutable.

巴特西

LeetCode 308. Range Sum Query 2D - Mutable

最新文章

热门文章