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

 Note:

   1.You may assume that the matrix does not change.
   2.There are many calls to sumRegion function.
   3.You may assume that row1 ≤ row2 and col1 ≤ col2.

个人总结：思路和Range Sum Query一样，只是需要把二位数组按行去求和；

ac代码；
public class NumMatrix {
    int rows,cols;
     int[][] sum_row;
   public NumMatrix(int[][] matrix){
       if(matrix.length==0 || matrix==null) return;
        sum_row = matrix;
        rows=matrix.length;
        cols=matrix[0].length;
      
       for(int i=0;i<rows;i++){
           for(int j=1;j<cols;j++){
               sum_row[i][j] =sum_row[i][j-1]+matrix[i][j];
           }
       }
   }
   
   
   public int sumRegion(int row1,int col1,int row2,int col2){
       
       if(row2+1>rows || col2+1>cols) return 0;
       int sum=0;
      
       if(col1>=1){
           for(int i=row1;i<=row2;i++){
               sum += sum_row[i][col2]-sum_row[i][col1-1];
           }
       }
       else {
           for(int i=row1;i<=row2;i++){
               sum += sum_row[i][col2];
           }
       }
    
       return sum;
      }
   }

 

转载于:https://www.cnblogs.com/summer323/p/5026643.html