Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrixsuch that its sum is no larger than k.
Example:
Input: matrix = [[1,0,1],[0,-2,3]], k = 2
Output: 2
Explanation: Because the sum of rectangle [[0, 1], [-2, 3]]
is 2,
and 2 is the max number no larger than k (k = 2).
Note:
- The rectangle inside the matrix must have an area > 0.
- What if the number of rows is much larger than the number of columns?
参考资料:here。
class Solution {
public:
int maxSumSubmatrix(vector<vector<int>>& matrix, int k) {
int m = matrix.size(), n = matrix[0].size(), ans = INT_MIN;
vector<vector<int>> sum(m, vector<int>(n));
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int tmp = matrix[i][j];
if (i > 0) tmp += sum[i - 1][j];
if (j > 0) tmp += sum[i][j - 1];
if (i > 0 && j > 0) tmp -= sum[i - 1][j - 1];
sum[i][j] = tmp;
for (int ii = 0; ii <= i; ii++) {
for (int jj = 0; jj <= j; jj++) {
int tmp = sum[i][j];
if (ii > 0) tmp -= sum[ii - 1][j];
if (jj > 0) tmp -= sum[i][jj - 1];
if (ii > 0 && jj > 0) tmp += sum[ii - 1][jj - 1];
if (tmp <= k) ans = max(ans, tmp);
}
}
}
}
return ans;
}
};