矩形区域不超过 K 的最大数值和

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

class Solution {
public:
    int maxSumSubmatrix(vector<vector<int>> &matrix, int k) {

        int m = matrix.size();
        int n = matrix[0].size();
        int maxV = INT32_MIN;

        for (int i = 0; i < m; ++i) {
            vector<int> temp(n, 0);
            for (int j = i; j < m; ++j) {
                for (int k = 0; k < n; ++k) {
                    temp[k] += matrix[j][k];
                }
                vector<int> tempA(n + 1, 0);
                for (int z = 0; z < n; ++z) {
                    tempA[z + 1] = tempA[z] + temp[z];
                    for (int l = 0; l < z + 1; ++l) {
                        int tempV = tempA[z + 1] - tempA[l];
                        if (tempV > maxV && tempV <= k)
                            maxV = tempV;
                    }
                }
            }
        }
        return maxV;
    }

};


int main() {
    vector<vector<int>> nums{{2, 2, -1}};
    Solution s;
    cout << s.maxSumSubmatrix(nums, 0) << endl;


}