LeetCode.304 二维区域和检索 - 矩阵不可变

原题

https://leetcode-cn.com/problems/range-sum-query-2d-immutable/

在这里插入图片描述

思路

标准的前缀和,这里只不过是二维数组的前缀和
在这里插入图片描述
这里盗用大佬的一张图,把大佬的连接给出来
https://leetcode-cn.com/problems/range-sum-query-2d-immutable/solution/er-wei-qian-zhui-he-jian-dan-tui-dao-tu-sqekv/

题解

package com.leetcode.code;

import java.util.LinkedHashMap;
import java.util.Map;
import java.util.TreeMap;

/**
 * @Description:
 * @ClassName: Code304
 * @Author: ZK
 * @Date: 2021/3/2 23:12
 * @Version: 1.0
 */
public class Code304 {

    int[][] sums;

    public Code304(int[][] matrix) {
        int row = matrix.length;
        if (row == 0) {
            return;
        }
        int col = matrix[0].length;
        sums = new int[row+1][col+1];
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < col; j++) {
                sums[i+1][j+1] = sums[i+1][j] + sums[i][j+1] - sums[i][j] + matrix[i][j];
            }
        }
    }

    public int sumRegion(int row1, int col1, int row2, int col2) {
        return sums[row2+1][col2+1] - sums[row1][col2+1] - sums[row2+1][col1] + sums[row1][col1];
    }

    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}
        };
        Code304 code304 = new Code304(matrix);
        int sum = code304.sumRegion(2, 1, 4, 3);
        System.out.println(sum);
    }

}

已标记关键词 清除标记
相关推荐
©️2020 CSDN 皮肤主题: 博客之星2019 设计师:CY__ 返回首页