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:
You may assume that the matrix does not change.
There are many calls to sumRegion function.
You may assume that row1 ≤ row2 and col1 ≤ col2.

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

 

我的思路：

1. 肯定是要用二维dp的，但是这个意义取值不太好整

2. 想到了用和，但还是有点模糊，看了下柳神的解法，有点豁然开朗

 

 

柳神思路：

1. 开一个和二维数组一样大小的矩阵v，v[i][j] 用来存储从（0,0）开始，右下角表为（i，j）的矩阵和的值。注意计算时，每个矩形的和多出一个（i-1,j-1）的值，因为多计算了一次

2. 计算（row1，col1，row2， col2）时，有不同的四种情况：

（1）row1 == col1 == 0： 此情况，最希望出现了，就是我们计算的v矩阵上（row2，col2）的值

（2）row1 == 0 以及 col1 == 0：此时矩形和为大矩形减去小矩形

（3）其他情况：大方块减去两个多余的小方块再加上重复减去的小方块

class NumMatrix {
public:
    vector<vector<int>> v;
    NumMatrix(vector<vector<int>>& matrix) {
        int m = matrix.size();
        if(matrix.empty()) return;
        int n = matrix[0].size();
        v = vector<vector<int>>(m, vector<int>(n));
        for(int i = 0; i < m; i++){
            for(int j = 0; j < n; j++){
                if(i==0 && j==0){
                    v[i][j] = matrix[i][j];
                }else if(i == 0){
                    v[i][j] = v[i][j-1] + matrix[i][j];
                }else if(j == 0){
                    v[i][j] = v[i-1][j] + matrix[i][j];
                }else{
                    v[i][j] = v[i-1][j] + v[i][j-1] + matrix[i][j] - v[i-1][j-1];
                }
            }
        }
        
    }
    
    int sumRegion(int row1, int col1, int row2, int col2) {
        if(row1==0 && col1==0){
            return v[row2][col2];
        }else if(row1 == 0){
            return v[row2][col2] - v[row2][col1-1];
        }else if(col1 == 0){
            return v[row2][col2] - v[row1-1][col2];
        }else{
            return v[row2][col2] - v[row1-1][col2] - v[row2][col1-1] + v[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);
 */