每日一题 day 47 (DP topic)

最新推荐文章于 2024-11-04 12:20:00 发布

NP_hard

最新推荐文章于 2024-11-04 12:20:00 发布

阅读量154

点赞数

分类专栏： LeetCode Learning 文章标签： leetcode 动态规划矩阵

本文链接：https://blog.csdn.net/np_hard/article/details/123398666

版权

LeetCode Learning 专栏收录该内容

60 篇文章 0 订阅

订阅专栏

文章目录

problem
approach

problem

304. Range Sum Query 2D - Immutable
Given a 2D matrix matrix, handle multiple queries of the following type:

Calculate the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).

Implement the NumMatrix class:

NumMatrix(int[][] matrix) Initializes the object with the integer matrix matrix.
int sumRegion(int row1, int col1, int row2, int col2) Returns the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).

Example 1:
在这里插入图片描述

Input
["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]]
Output
[null, 8, 11, 12]
Explanation
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 (i.e sum of the red rectangle)
numMatrix.sumRegion(1, 1, 2, 2); // return 11 (i.e sum of the green rectangle)
numMatrix.sumRegion(1, 2, 2, 4); // return 12 (i.e sum of the blue rectangle)

approach

class NumMatrix {
public:
    //#define vv vector<vector<int>>
    vector<vector<int>> prefix;
    int m, n;
    
    int get(int i, int j){
        if(i < 0 || j < 0)return 0;
        if(i >= m)i = m-1;
        if(j >= n)j = n-1;
        return prefix[i][j];
    }
    
    NumMatrix(vector<vector<int>>& matrix) {
        m = matrix.size(), n = matrix[0].size();
        prefix = vector<vector<int>>(m, vector<int>(n, 0));
        for(int i=0; i<m; i++)
            for(int j=0; j<n; j++)
                prefix[i][j] = matrix[i][j] + get(i-1, j) + get(i, j-1) - get(i-1, j-1); 
    }
    
    int sumRegion(int row1, int col1, int row2, int col2) {
        return get(row2, col2) + get(row1-1, col1-1) - get(row2, col1-1) - get(row1-1, col2);
    }
};

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