Class Solution
-
- All Implemented Interfaces:
public final class Solution1074 - Number of Submatrices That Sum to Target.
Hard
Given a
matrixand atarget, return the number of non-empty submatrices that sum to target.A submatrix
x1, y1, x2, y2is the set of all cellsmatrix[x][y]withx1 <= x <= x2andy1 <= y <= y2.Two submatrices
(x1, y1, x2, y2)and(x1', y1', x2', y2')are different if they have some coordinate that is different: for example, ifx1 != x1'.Example 1:
Input: matrix = \[\[0,1,0],1,1,1,0,1,0], target = 0
Output: 4
Explanation: The four 1x1 submatrices that only contain 0.
Example 2:
Input: matrix = \[\[1,-1],-1,1], target = 0
Output: 5
Explanation: The two 1x2 submatrices, plus the two 2x1 submatrices, plus the 2x2 submatrix.
Example 3:
Input: matrix = \[\[904]], target = 0
Output: 0
Constraints:
1 <= matrix.length <= 1001 <= matrix[0].length <= 100-1000 <= matrix[i] <= 1000-10^8 <= target <= 10^8
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final IntegernumSubmatrixSumTarget(Array<IntArray> matrix, Integer target)-
-
Method Detail
-
numSubmatrixSumTarget
final Integer numSubmatrixSumTarget(Array<IntArray> matrix, Integer target)
-
-
-
-