LeetCode 304. Range Sum Query 2D - Immutable

最新推荐文章于 2020-09-24 22:58:54 发布

ov大鱼vo

最新推荐文章于 2020-09-24 22:58:54 发布

阅读量233

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode Java

本文链接：https://blog.csdn.net/flowingfog/article/details/88100175

LeetCode 同时被 2 个专栏收录

77 篇文章

订阅专栏

Java

24 篇文章

订阅专栏

本文介绍了一种高效解决二维矩阵区间求和问题的方法。通过预处理矩阵，将每个元素替换为该行前缀和，从而在O(1)时间内完成任意矩形区域的求和操作。这种方法特别适用于矩阵不会改变，但需要频繁进行区间求和的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

分析

难度中
来源 https://leetcode.com/problems/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.

解答

Runtime: 58 ms, faster than 100.00% of Java online submissions for Range Sum Query 2D - Immutable.
Memory Usage: 50.5 MB, less than 13.98% of Java online submissions for Range Sum Query 2D - Immutable.

package LeetCode;

/**
 * Your NumMatrix object will be instantiated and called as such:
 * NumMatrix obj = new NumMatrix(matrix);
 * int param_1 = obj.sumRegion(row1,col1,row2,col2);
 */
public class L304_RangeSumQuery2D_Immutable {
    private int[][] matrix;
    /* public L304_RangeSumQuery2D_Immutable(int[][] matrix) {
         this.matrix=matrix;
     }
 
     public int sumRegion(int row1, int col1, int row2, int col2) {
         int result=0;
         for(int i=row1;i<=row2;i++){
             for(int j=col1;j<=col2;j++){
                 result+=matrix[i][j];
             }
         }
         return  result;
     }*/
    public L304_RangeSumQuery2D_Immutable(int[][] matrix) {
        this.matrix=matrix;
        for(int i=0;i<matrix.length;i++){
            for(int j=1;j<matrix[0].length;j++){
                matrix[i][j]+=matrix[i][j-1];//同一行使用累加和。
            }
        }
    }

    public int sumRegion(int row1, int col1, int row2, int col2) {
        if(row2>=matrix.length||col2>=matrix[0].length)
            return 0;
        int result=0;
        if(col1==0){
            for(int i=row1;i<=row2;i++)
                result+=matrix[i][col2];
        }else{
            for(int i=row1;i<=row2;i++)
                result+=(matrix[i][col2]-matrix[i][col1-1]);
        }
        return  result;
    }
    public static void main(String[] args){
        int[][] 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}
                        };
        L304_RangeSumQuery2D_Immutable l304=new L304_RangeSumQuery2D_Immutable(matrix);
        System.out.println(l304.sumRegion(2,1,4,3));
    }
}