给你一个 m x n 的矩阵 matrix 和一个整数 k ,找出并返回矩阵内部矩形区域的不超过 k 的最大数值和。
题目数据保证总会存在一个数值和不超过 k 的矩形区域。
示例 1:
输入:matrix = [[1,0,1],[0,-2,3]], k = 2
输出:2
解释:蓝色边框圈出来的矩形区域 [[0, 1], [-2, 3]] 的数值和是 2,且 2 是不超过 k 的最大数字(k = 2)。
示例 2:
输入:matrix = [[2,2,-1]], k = 3
输出:3
提示:
- m == matrix.length
- n == matrix[i].length
- 1 <= m, n <= 100
- -100 <= matrix[i][j] <= 100
- -105 <= k <= 105
解题思路一:暴力求解(超出内存限制)
class Solution {
public int maxSumSubmatrix(int[][] matrix,int k){
int rows = matrix.length;
int cols = matrix[0].length;
int max = Integer.MIN_VALUE;
int[][][][] dp = new int[rows+1][cols+1][rows+1][cols+1];
for (int i1 = 1; i1 <= rows; i1++) {
for (int j1 = 1; j1 <= cols; j1++) {
dp[i1][j1][i1][j1] = matrix[i1-1][j1-1];
for (int i2 = i1; i2 <= rows; i2++) {
for (int j2 = j1; j2 <= cols; j2++) {
dp[i1][j1][i2][j2] = dp[i1][j1][i2-1][j2] + dp[i1][j1][i2][j2-1] - dp[i1][j1][i2-1][j2-1] + matrix[i2-1][j2-1];
if(dp[i1][j1][i2][j2] <= k && dp[i1][j1][i2][j2] > max)
max = dp[i1][j1][i2][j2];
}
}
}
}
return max;
}
}
解题思路二:在思路一的基础上进行状态压缩
class Solution {
public int maxSumSubmatrix(int[][] matrix,int k){
int rows = matrix.length;
int cols = matrix[0].length;
int max = Integer.MIN_VALUE;
for (int i1 = 1; i1 <= rows; i1++) {
for (int j1 = 1; j1 <= cols; j1++) {
int[][] dp = new int[rows+1][cols+1];//注意该位置,每次都重置
dp[i1][j1] = matrix[i1-1][j1-1];
for (int i2 = i1; i2 <= rows; i2++) {
for (int j2 = j1; j2 <= cols; j2++) {
dp[i2][j2] = dp[i2-1][j2] + dp[i2][j2-1] - dp[i2-1][j2-1] + matrix[i2-1][j2-1];
if(dp[i2][j2] <= k && dp[i2][j2] > max)
max = dp[i2][j2];
}
}
}
}
return max;
}
}
解题思路三:固定左右边界,进行数组滚动
class Solution {
public int maxSumSubmatrix(int[][] matrix,int k){
int rows = matrix.length;
int cols = matrix[0].length;
int max = Integer.MIN_VALUE;
for (int l = 0; l < cols; l++) {//枚举左边界
int[] rowSum = new int[rows];//左边界改变才算区域的重新开始
for (int r = l; r < cols; r++) {//枚举右边界
for (int i = 0; i < rows; i++) {//按每一行累计到 dp
rowSum[i] += matrix[i][r];
}
// 求 rowSum 连续子数组 的 和
// 和 尽量大,但不大于 k
max = Math.max(max, dpmax(rowSum,k));
}
}
return max;
}
// 在数组 arr 中,求不超过 k 的最大值
private int dpmax(int[] arr, int k){
int max = Integer.MIN_VALUE;
for (int l = 0; l < arr.length; l++) {
int sum = 0;
for (int r = l; r < arr.length; r++) {
sum += arr[r];
if(sum > max && sum <= k)
max = sum;
}
}
return max;
}
}
参考大佬题解:这里