[leetcode] 1314. Matrix Block Sum

Description

Given a m * n matrix mat and an integer K, return a matrix answer where each answer[i][j] is the sum of all elements mat[r][c] for i - K <= r <= i + K, j - K <= c <= j + K, and (r, c) is a valid position in the matrix.

Example 1:

Input: mat = [[1,2,3],[4,5,6],[7,8,9]], K = 1
Output: [[12,21,16],[27,45,33],[24,39,28]]

Example 2:

Input: mat = [[1,2,3],[4,5,6],[7,8,9]], K = 2
Output: [[45,45,45],[45,45,45],[45,45,45]]

Constraints:

• m == mat.length
• n == mat[i].length
• 1 <= m, n, K <= 100
• 1 <= mat[i][j] <= 100

分析

题目的意思是：给定一个矩阵，求出矩阵中每个位置k范围内的和，这里求k范围内的和，如果能够预先算出来，就不用在遍历的时候进行计算了，减少了计算量；dp[i][j]表示前长度为i，宽度为j的矩阵的和，所以有：

dp[i][j]=mat[i-1][j-1]+dp[i][j-1]+dp[i-1][j]-dp[i-1][j-1]

则矩阵的每个位置的和的计算就简单了，学过数学就知道大矩形减去两边的小矩形，然后再加上一个小矩形的和的就是剩下的矩形的和了，公式为：

 res[i-1][j-1]=dp[x2][y2]-dp[x1][y2]-dp[x2][y1]+dp[x1][y1]

代码

class Solution:
    def matrixBlockSum(self, mat: List[List[int]], K: int) -> List[List[int]]:
        m=len(mat)
        n=len(mat[0])
        dp=[[0]*(n+1) for i in range(m+1)]
        for i in range(m+1):
            for j in range(n+1):
                if(i>0 and j>0):
                    dp[i][j]=mat[i-1][j-1]+dp[i][j-1]+dp[i-1][j]-dp[i-1][j-1]
        res=[[0]*n for i in range(m)]
        for i in range(1,m+1):
            for j in range(1,n+1):
                x1,y1=max(i-K-1,0),max(j-K-1,0)
                x2,y2=min(i+K,m),min(j+K,n)
                res[i-1][j-1]=dp[x2][y2]-dp[x1][y2]-dp[x2][y1]+dp[x1][y1]
        return res

参考文献

[LeetCode] Leetcode 1314.矩阵区域和（Matrix Block Sum）