Maximum Side Length of a Square with Sum Less than or Equal to Threshold
Given an m x n matrix mat and an integer threshold, return the maximum side length of a square with a sum less than or equal to threshold, or return 0 if there is no such square.
Example 1
1 1 3 2 4 3 2 1 1 3 2 4 3 2 1 1 3 2 4 3 2
Input
mat = [[1,1,3,2,4,3,2],[1,1,3,2,4,3,2],[1,1,3,2,4,3,2]], threshold = 4Output
2The maximum side length of a square with sum less than or equal to 4 is 2.
Example 2
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
Input
mat = [[2,2,2,2,2],[2,2,2,2,2],[2,2,2,2,2],[2,2,2,2,2],[2,2,2,2,2]], threshold = 1Output
0Every non-empty square has sum greater than 1, so no valid square exists.
Constraints
- m == mat.length
- n == mat[i].length
- 1 <= m, n <= 300
- 0 <= mat[i][j] <= 10^4
- 0 <= threshold <= 10^5