力扣304. 二维区域和检索 - 矩阵不可变

给定一个二维矩阵 matrix，以下类型的多个请求：

计算其子矩形范围内元素的总和，该子矩阵的左上角为 (row1, col1) ，右下角为 (row2, col2) 。
实现 NumMatrix 类：

NumMatrix(int[][] matrix) 给定整数矩阵 matrix 进行初始化
int sumRegion(int row1, int col1, int row2, int col2) 返回左上角 (row1, col1) 、右下角 (row2, col2) 的子矩阵的元素总和。
 

示例 1：

输入: 
["NumMatrix","sumRegion","sumRegion","sumRegion"]
[[[[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]]],[2,1,4,3],[1,1,2,2],[1,2,2,4]]
输出: 
[null, 8, 11, 12]

解释:
NumMatrix numMatrix = new NumMatrix([[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]]]);
numMatrix.sumRegion(2, 1, 4, 3); // return 8 (红色矩形框的元素总和)
numMatrix.sumRegion(1, 1, 2, 2); // return 11 (绿色矩形框的元素总和)
numMatrix.sumRegion(1, 2, 2, 4); // return 12 (蓝色矩形框的元素总和)
 

提示：

m == matrix.length
n == matrix[i].length
1 <= m, n <= 200
-105 <= matrix[i][j] <= 105
0 <= row1 <= row2 < m
0 <= col1 <= col2 < n
最多调用 104 次 sumRegion 方法

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/range-sum-query-2d-immutable
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class NumMatrix {
    int[][] presum;
    public NumMatrix(int[][] matrix) {
        presum=new int[matrix.length][matrix[0].length];
        presum[0][0]=matrix[0][0];
        for(int i=1;i<presum[0].length;i++){
            presum[0][i]=presum[0][i-1]+matrix[0][i];
        }
        for(int i=1;i<presum.length;i++){
            presum[i][0]=presum[i-1][0]+matrix[i][0];
        }
        for(int i=1;i<presum.length;i++){
            for(int j=1;j<presum[i].length;j++){
                presum[i][j]=presum[i-1][j]+presum[i][j-1]+matrix[i][j]-presum[i-1][j-1];
            }
        }
    }
    
    public int sumRegion(int row1, int col1, int row2, int col2) {
        if(row1==0&&col1==0){
            return presum[row2][col2];
        }
        else if(row1==0&&col1!=0){
            return presum[row2][col2]-presum[row2][col1-1];
        }
        else if(row1!=0&&col1==0){
            return presum[row2][col2]-presum[row1-1][col2];
        }
        else{
            return presum[row2][col2]-presum[row2][col1-1]-presum[row1-1][col2]
            +presum[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);
 */

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

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