zoukankan      html  css  js  c++  java
  • 304. Range Sum Query 2D

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

     本题比较简单,有一个难点就是,做二维和数组的时候,可以做出长度+1的二维数组,这样就不用考虑0的情况了,代码如下:

     1 public class NumMatrix {
     2     int[][] sum;
     3     public NumMatrix(int[][] matrix) {
     4         if(matrix==null||matrix.length==0||matrix[0].length==0) return;
     5         sum = new int[matrix.length+1][matrix[0].length+1];
     6         for(int i=0;i<matrix.length;i++){
     7             for(int j=0;j<matrix[0].length;j++){
     8                 sum[i+1][j+1] = sum[i+1][j]+sum[i][j+1]-sum[i][j]+matrix[i][j];
     9             }
    10         }
    11     }
    12     
    13     public int sumRegion(int row1, int col1, int row2, int col2) {
    14         return sum[row2+1][col2+1]-sum[row1][col2+1]-sum[row2+1][col1]+sum[row1][col1];
    15     }
    16 }
    17 
    18 /**
    19  * Your NumMatrix object will be instantiated and called as such:
    20  * NumMatrix obj = new NumMatrix(matrix);
    21  * int param_1 = obj.sumRegion(row1,col1,row2,col2);
    22  */
  • 相关阅读:
    Maven笔记(一)
    Oracle JDBC通过占位符可以查询可变长字段,不可查询固定长度字段
    Oracle 汉字在不同字符集下所占字节
    Spring Bean注册解析(一)
    Spring AOP切点表达式用法总结
    ThreadPoolExecutor详解
    数据库索引创建与优化
    ScheduledThreadPoolExecutor详解
    使用三种方法求解前N个正整数的排列
    后缀表达式的计算
  • 原文地址:https://www.cnblogs.com/codeskiller/p/6495183.html
Copyright © 2011-2022 走看看