2022-08-27 update: added "Max Sum of Rectangle No Larger Than K" (#75)

* 2022-08-27 update: added "Max Sum of Rectangle No Larger Than K"

* 2022-08-27 update: added "Max Sum of Rectangle No Larger Than K"

Author: fartem

README.md

@@ -32,6 +32,7 @@ Soon.
 | 233. Number of Digit One                      | [Link](https://leetcode.com/problems/number-of-digit-one/)                       | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/hard/NumberOfDigitOne.java)                     |
 | 239. Sliding Window Maximum                   | [Link](https://leetcode.com/problems/sliding-window-maximum/)                    | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/hard/SlidingWindowMaximum.java)                 |
 | 297. Serialize and Deserialize Binary Tree    | [Link](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)     | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/hard/SerializeAndDeserializeBinaryTree.java)    |
+| 363. Max Sum of Rectangle No Larger Than K    | [Link](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/)     | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/hard/MaxSumOfRectangleNoLargerThanK.java)       |
 | 458. Poor Pigs                                | [Link](https://leetcode.com/problems/poor-pigs/)                                 | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/hard/PoorPigs.java)                             |
 | 871. Minimum Number of Refueling Stops        | [Link](https://leetcode.com/problems/minimum-number-of-refueling-stops/)         | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/hard/MinimumNumberOfRefuelingStops.java)        |
 | 936. Stamping The Sequence                    | [Link](https://leetcode.com/problems/stamping-the-sequence/)                     | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/hard/StampingTheSequence.java)                  |

src/main/java/com/smlnskgmail/jaman/leetcodejava/hard/MaxSumOfRectangleNoLargerThanK.java

@@ -0,0 +1,42 @@
+package com.smlnskgmail.jaman.leetcodejava.hard;
+
+// https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/
+public class MaxSumOfRectangleNoLargerThanK {
+
+    private final int[][] matrix;
+    private final int k;
+
+    public MaxSumOfRectangleNoLargerThanK(int[][] matrix, int k) {
+        this.matrix = matrix;
+        this.k = k;
+    }
+
+    public int solution() {
+        int m = matrix.length;
+        int n = matrix[0].length;
+        int[][] dp = new int[m + 1][n + 1];
+        for (int i = 1; i <= m; i++) {
+            for (int j = 1; j <= n; j++) {
+                dp[i][j] = dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1] + matrix[i - 1][j - 1];
+            }
+        }
+        int result = Integer.MIN_VALUE;
+        for (int i = 0; i < m; i++) {
+            for (int j = 0; j < n; j++) {
+                for (int a = i + 1; a <= m; a++) {
+                    for (int b = j + 1; b <= n; b++) {
+                        int temp = dp[a][b] - dp[a][j] - dp[i][b] + dp[i][j];
+                        if (temp <= k) {
+                            if (temp == k) {
+                                return k;
+                            }
+                            result = Math.max(result, temp);
+                        }
+                    }
+                }
+            }
+        }
+        return result;
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/hard/MaxSumOfRectangleNoLargerThanKTest.java

@@ -0,0 +1,20 @@
+package com.smlnskgmail.jaman.leetcodejava.hard;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class MaxSumOfRectangleNoLargerThanKTest {
+
+    @Test
+    public void defaultTest() {
+        assertEquals(
+                2,
+                new MaxSumOfRectangleNoLargerThanK(
+                        new int[][]{{1, 0, 1}, {0, -2, 3}},
+                        2
+                ).solution()
+        );
+    }
+
+}