diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/max_sum_rectangle.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/max_sum_rectangle.cpp')
-rw-r--r-- | other/max_sum_rectangle.cpp | 33 |
1 files changed, 0 insertions, 33 deletions
diff --git a/other/max_sum_rectangle.cpp b/other/max_sum_rectangle.cpp deleted file mode 100644 index 9b252e1..0000000 --- a/other/max_sum_rectangle.cpp +++ /dev/null @@ -1,33 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int maxSumSubmatrix(vector<vector<int>> &matrix, int k) { - int ans = INT_MIN, rows = matrix.size(), cols = matrix[0].size(); - for (int l = 0; l < cols; ++l) { - vector<int> sums(rows); - for (int r = l; r < cols; ++r) { - int pMin = 0, pMax = INT_MIN; - for (int i = 0; i < rows; ++i) { - sums[i] += matrix[i][r]; - pMin = max(pMin + sums[i], sums[i]); - pMax = max(pMax, pMin); - } - if (pMax <= k) { - ans = max(ans, pMax); - continue; - } - set<int> s = {0}; - int runSum = 0; - for (int sum : sums) { - runSum += sum; - auto it = s.lower_bound(runSum - k); - if (it != end(s)) - ans = max(ans, runSum - *it); - s.insert(runSum); - } - } - } - return ans; - } -}; |