10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T47f,import java.util.TreeSet; class Solution { public int maxSumSubmatrix(int[][] matrix, int k) { int m = matrix.length, n = matrix[0].length; int ans = Integer.MIN_VALUE; boolean colIsSmaller = n < m; int rows = colIsSmaller ? n : m; int cols = colIsSmaller ? m : n; for (int l = 0; l < cols; l++) { int[] rowSums = new int[rows]; for (int r = l; r < cols; r++) { for (int rIdx = 0; rIdx < rows; rIdx++) { int val = colIsSmaller ? matrix[r][rIdx] : matrix[rIdx][r]; rowSums[rIdx] += val; } TreeSet set = new TreeSet<>(); set.add(0); int currSum = 0; for (int s : rowSums) { currSum += s; Integer target = set.ceiling(currSum - k); if (target != null) { ans = Math.max(ans, currSum - target); } set.add(currSum); } } } return ans; } }13:T4a4,#include #include #include #include class Solution { public: int maxSumSubmatrix(std::vector>& matrix, int k) { int m = matrix.size(), n = matrix[0].size(); int ans = INT_MIN; bool colIsSmaller = n < m; int rows = colIsSmaller ? n : m; int cols = colIsSmaller ? m : n; for (int l = 0; l < cols; l++) { std::vector rowSums(rows, 0); for (int r = l; r < cols; r++) { for (int rIdx = 0; rIdx < rows; rIdx++) { int val = colIsSmaller ? matrix[r][rIdx] : matrix[rIdx][r]; rowSums[rIdx] += val; } std::set s; s.insert(0); int currSum = 0; for (int sum : rowSums) { currSum += sum; auto it = s.lower_bound(currSum - k); if (it != s.end()) { ans = std::max(ans, currSum - *it); } s.insert(currSum); } } } return ans; } };14:T5b5,

Time Complexity

Space Complexity