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

1. You may assume that row1 ≤ row2 and col1 ≤ col2.

题目分析：题目不难，典型的前缀和问题

方阵不变，查询众多

法一：预处理每行的列前缀和，查询的时候对行循环累加（耗时160ms 击败13.71%）

public class NumMatrix {
    
    public int[][] rowSum;

    public NumMatrix(int[][] matrix) {
        int n = matrix.length;
        if (n == 0) {
            return;
        }
        int m = matrix[0].length;
        rowSum = new int[n][m];
        for (int i = 0; i < n; i ++) {
            rowSum[i][0] = matrix[i][0];
            for (int j = 1; j < m; j ++) {
                rowSum[i][j] = rowSum[i][j - 1] + matrix[i][j];
            }
        }
    }
    
    public int sumRegion(int row1, int col1, int row2, int col2) {
        int ans = 0;
        for (int i = row1; i <= row2; i ++) {
            if (col1 == 0) {
                ans += rowSum[i][col2];
            } else {
                ans += rowSum[i][col2] - rowSum[i][col1 - 1];
            }
        }
        return ans;
    }
}

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

法二：预处理每个点到点(0,0)的和，询问时通过简单容斥O(1)即可，为了方便起见，将矩阵向右下移动一格（耗时121ms 击败94.18%）

public class NumMatrix {
    
    public int[][] sum;

    public NumMatrix(int[][] matrix) {
        int n = matrix.length;
        if (n == 0) {
            return;
        }
        int m = matrix[0].length;
        sum = new int[n + 1][m + 1];
        sum[1][1] = matrix[0][0];
        for (int i = 2; i <= n; i ++) {
            sum[i][1] = sum[i - 1][1] + matrix[i - 1][0];
        }
        for (int j = 2; j <= m; j ++) {
            sum[1][j] = sum[1][j - 1] + matrix[0][j - 1];
        }
        for (int i = 2; i <= n; i ++) {
            for (int j = 2; j <= m; j ++) {
                sum[i][j] = matrix[i - 1][j - 1] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
            }
        }
    }
    
    public int sumRegion(int row1, int col1, int row2, int col2) {
        row1 ++; col1 ++; row2 ++; col2 ++;
        return sum[row2][col2] - sum[row1 - 1][col2] - sum[row2][col1 - 1] + sum[row1 - 1][col1 - 1];
    }
}

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