feat: add solutions to lc problem: No.0363 (doocs#1565)

No.0363.Max Sum of Rectangle No Larger Than K

Author: yanglbme

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/README.md

@@ -0,0 +1,28 @@
+class Solution {
+public:
+    int maxSumSubmatrix(vector<vector<int>>& matrix, int k) {
+        int m = matrix.size(), n = matrix[0].size();
+        const int inf = 1 << 30;
+        int ans = -inf;
+        for (int i = 0; i < m; ++i) {
+            vector<int> nums(n);
+            for (int j = i; j < m; ++j) {
+                for (int h = 0; h < n; ++h) {
+                    nums[h] += matrix[j][h];
+                }
+                set<int> ts;
+                int s = 0;
+                ts.insert(0);
+                for (int x : nums) {
+                    s += x;
+                    auto it = ts.lower_bound(s - k);
+                    if (it != ts.end()) {
+                        ans = max(ans, s - *it);
+                    }
+                    ts.insert(s);
+                }
+            }
+        }
+        return ans;
+    }
+};

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/README_EN.md

@@ -0,0 +1,32 @@
+func maxSumSubmatrix(matrix [][]int, k int) int {
+	m, n := len(matrix), len(matrix[0])
+	const inf = 1 << 30
+	ans := -inf
+	for i := 0; i < m; i++ {
+		nums := make([]int, n)
+		for j := i; j < m; j++ {
+			for h := 0; h < n; h++ {
+				nums[h] += matrix[j][h]
+			}
+			s := 0
+			rbt := redblacktree.NewWithIntComparator()
+			rbt.Put(0, nil)
+			for _, x := range nums {
+				s += x
+				if y, ok := rbt.Ceiling(s - k); ok {
+					ans = max(ans, s-y.Key.(int))
+				}
+				rbt.Put(s, nil)
+			}
+		}
+
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/Solution.cpp

@@ -0,0 +1,28 @@
+class Solution {
+    public int maxSumSubmatrix(int[][] matrix, int k) {
+        int m = matrix.length;
+        int n = matrix[0].length;
+        final int inf = 1 << 30;
+        int ans = -inf;
+        for (int i = 0; i < m; ++i) {
+            int[] nums = new int[n];
+            for (int j = i; j < m; ++j) {
+                for (int h = 0; h < n; ++h) {
+                    nums[h] += matrix[j][h];
+                }
+                int s = 0;
+                TreeSet<Integer> ts = new TreeSet<>();
+                ts.add(0);
+                for (int x : nums) {
+                    s += x;
+                    Integer y = ts.ceiling(s - k);
+                    if (y != null) {
+                        ans = Math.max(ans, s - y);
+                    }
+                    ts.add(s);
+                }
+            }
+        }
+        return ans;
+    }
+}

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/Solution.go

@@ -0,0 +1,21 @@
+from sortedcontainers import SortedSet
+
+
+class Solution:
+    def maxSumSubmatrix(self, matrix: List[List[int]], k: int) -> int:
+        m, n = len(matrix), len(matrix[0])
+        ans = -inf
+        for i in range(m):
+            nums = [0] * n
+            for j in range(i, m):
+                for h in range(n):
+                    nums[h] += matrix[j][h]
+                s = 0
+                ts = SortedSet([0])
+                for x in nums:
+                    s += x
+                    p = ts.bisect_left(s - k)
+                    if p != len(ts):
+                        ans = max(ans, s - ts[p])
+                    ts.add(s)
+        return ans