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

最新推荐文章于 2025-02-12 15:50:34 发布

三岁就很萌@D

最新推荐文章于 2025-02-12 15:50:34 发布

阅读量630

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/qq_44822951/article/details/122806924

版权

leetcode 专栏收录该内容

151 篇文章

订阅专栏

在这里插入图片描述

class NumMatrix {
    int m;
    int n;
    int[][] preSum;
    public NumMatrix(int[][] matrix) {
        m = matrix.length;
        n = matrix[0].length;
        preSum = new int[m][n];
        for(int i = 0;i < m;i++){
            for(int j = 0;j < n;j++){
                int left = inArea(i,j-1) == true ? preSum[i][j-1]:0;
                int up = inArea(i-1,j) == true ? preSum[i-1][j]:0;
                int leftup = inArea(i-1,j-1) == true ? preSum[i-1][j-1]:0;
                preSum[i][j] = left + up - leftup + matrix[i][j];
            }
        }
    }
    public boolean inArea(int x,int y){
        return x >= 0 && x < m && y >= 0 && y < n;
    }
    public int sumRegion(int row1, int col1, int row2, int col2) {
        int left = inArea(row2,col1-1) == true ? preSum[row2][col1-1]:0;
        int up = inArea(row1-1,col2) == true ? preSum[row1-1][col2]:0;
        int leftup = inArea(row1-1,col1-1) == true ? preSum[row1-1][col1-1]:0;
        return preSum[row2][col2] - left - up + leftup;
    }
}