–
1314. 矩阵区域求和
给你一个 m * n 的矩阵 mat 和一个整数 K ,请你返回一个矩阵 answer ,其中每个 answer[i][j] 是所有满足下述条件的元素 mat[r][c] 的和:
i - K <= r <= i + K, j - K <= c <= j + K
(r, c) 在矩阵内。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/matrix-block-sum
class Solution {
public int[][] matrixBlockSum(int[][] mat, int K) {
//1. dp 预处理,得到区间和
//状态;选择
//dp[i][j]=sum 表示(0,0) 到 (i,j) 区间和
int m = mat.length;
int n = mat[0].length;
int[][] dp = new int[m][n];
//base case
int sum = 0;
for (int j = 0;j < n;j++){
sum += mat[0][j];
dp[0][j] = sum;
}
sum = mat[0][0];
for (int i = 1;i < m;i++){
sum += mat[i][0];
dp[i][0] = sum;
}
//状态转移
for (int i = 1;i < m;i++){
for (int j = 1;j < n;j++){//当前区域和=左侧区域和+上方区域和-重复的左上区域和
dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1] + mat[i][j];
}
}
//2. 矩阵区域和
int xDownBound,yRightBound;
int xUpBound,yLeftBound;
int[][] ans = new int[m][n];
for (int i = 0;i < m;i++){
for (int j = 0;j < n;j++){
xDownBound = i + K < m ? (i + K) : m-1;
yRightBound = j + K < n ? (j + K) : n-1;
xUpBound = i - K - 1;
yLeftBound = j - K - 1;
ans[i][j] += dp[xDownBound][yRightBound];//(0,0) ->(xDownBound,yRightBound)
if (xUpBound >=0)// 减去边界上方的和
ans[i][j] -= dp[xUpBound][yRightBound];
if (yLeftBound >= 0)// 减去边界左边的和
ans[i][j] -= dp[xDownBound][yLeftBound];
if (xUpBound >= 0 && yLeftBound >= 0)// 加上左上重复减去和
ans[i][j] += dp[xUpBound][yLeftBound];
}
}
return ans;
}
}