每周LeetCode算法题（十）: 304. Range Sum Query 2D - Immutable

每周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).

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.

解法分析

做法很简单，新建一个等大的矩阵，从上到下、从左到右地，利用前面以求得的和，算出以（0，0）和原矩阵（i，j）为对角的矩阵的和，作为新矩阵（i，j）的值。这样，每次求给定坐标和大小的矩阵的元素和时，就能利用三个角上的值通过简单的加减运算求出。

C++代码

class NumMatrix {
public:
    vector<vector<int>> sum;
    NumMatrix(vector<vector<int>> matrix) {
        int n = matrix.size();
        if (n == 0) {
            return;
        }
        int m = matrix[0].size();
        sum.resize(n);
        for (int i = 0; i < n; i++) {
            sum[i].resize(m, 0);
        }
        sum[0][0] = matrix[0][0];
        for (int i = 1; i < n; i++) {
            sum[i][0] = sum[i - 1][0] + matrix[i][0];
        }
        for (int i = 1; i < m; i++) {
            sum[0][i] = sum[0][i - 1] + matrix[0][i];
        }
        for (int i = 1; i < n; i++) {
            for (int j = 1; j < m; j++) {
                sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + matrix[i][j];
            }
        }
    }

    int sumRegion(int row1, int col1, int row2, int col2) {
        if (row1 == 0 && col1 == 0) {
            return sum[row2][col2];
        } else if (row1 == 0) {
            return sum[row2][col2] - sum[row2][col1 - 1];
        } else if (col1 == 0) {
            return sum[row2][col2] - sum[row1 - 1][col2]];
        }
        return sum[row2][col2] + sum[row1 - 1][col1 - 1] - sum[row1 - 1][col2] - sum[row2][col1 - 1];
    }
};