LeetCode 304 Range Sum Query 2D - Immutable（维护二维数组的前缀和）

最新推荐文章于 2019-01-22 17:27:13 发布

nudt_oys

最新推荐文章于 2019-01-22 17:27:13 发布

阅读量878

点赞数

分类专栏：数据结构 LeetCode题解——C/C++版文章标签： LeetCode 前缀和

本文链接：https://blog.csdn.net/qq_26658823/article/details/76691442

版权

LeetCode题解——C/C++版同时被 2 个专栏收录

69 篇文章 13 订阅

订阅专栏

数据结构

66 篇文章 0 订阅

订阅专栏

这篇博客主要讲解了LeetCode 304题目的解决方案，该题目要求在不改变二维矩阵的情况下，快速计算给定矩形区域内的元素总和。通过维护前缀和，可以实现高效的查询。文章介绍了问题背景、示例、解题思路，并提供了相应的解题代码。

摘要由CSDN通过智能技术生成

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:

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.

题目大意：给出一个row*col的矩阵，再给出两个点A(row1, col1)和B(row2, col2)，求以A为左上角，B为右下角的矩形中所包含的元素之和。

解题思路：这道题是LeetCode 303 Range Sum Query - Immutable的加强版，LeetCode 303是在一维数组上的查询，而这道题是在二维数组上的查询。处理方式基本上一样，都是维护前缀和。其中obj->arr[i][j]中存储的是以(1, 1)为左上角，(i, j)为右下角的矩形中的元素之和。

代码如下：

typedef struct {
    int** arr;
    int row;
    int col;
} NumMatrix;

NumMatrix* numMatrixCreate(int** matrix, int matrixRowSize, int matrixColSize) {
    NumMatrix *obj = malloc(sizeof *obj);
    obj->row = matrixRowSize;
    obj->col = matrixColSize;
    
    obj->arr = malloc(sizeof(int*) * (obj->row + 1));
    for(int i = 0;i <= obj->row;i++) obj->arr[i] = malloc(sizeof(int) * (obj->col + 1));
    
    if(!obj->row && !obj->col) return obj;
    obj->arr[1][1] = matrix[0][0];
    obj->arr[0][0] = obj->arr[1][0] = obj->arr[0][1] = 0;
    for(int i = 1;i < obj->row;i++) obj->arr[i + 1][1] = obj->arr[i][1] + matrix[i][0],obj->arr[i + 1][0] = 0;
    for(int j = 1;j < obj->col;j++) obj->arr[1][j + 1] = obj->arr[1][j] + matrix[0][j],obj->arr[0][j + 1] = 0;
    
    for(int i = 1;i < obj->row;i++){
        for(int j = 1;j < obj->col;j++){
            obj->arr[i + 1][j + 1] = matrix[i][j] + obj->arr[i + 1][j] + obj->arr[i][j+1] - obj->arr[i][j];
        }
    }
    return obj;
}

int numMatrixSumRegion(NumMatrix* obj, int row1, int col1, int row2, int col2) {
    return obj->arr[row2 + 1][col2 + 1] - obj->arr[row2 + 1][col1] - obj->arr[row1][col2 + 1] + obj->arr[row1][col1];
}

void numMatrixFree(NumMatrix* obj) {
    for(int i = 0;i <= obj->row;i++) free(obj->arr[i]);
    free(obj->arr);   
    free(obj);
}

/**
 * Your NumMatrix struct will be instantiated and called as such:
 * struct NumMatrix* obj = numMatrixCreate(matrix, matrixRowSize, matrixColSize);
 * int param_1 = numMatrixSumRegion(obj, row1, col1, row2, col2);
 * numMatrixFree(obj);
 */