max-sum-of-rectangle-no-larger-than-k

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an <code>m x n</code> matrix <code>matrix</code> and an integer <code>k</code>, return the max sum of a rectangle in the matrix such that its sum is no larger than <code>k</code>.

It is guaranteed that there will be a rectangle with a sum no larger than <code>k</code>.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/18/sum-grid.jpg" style="width: 255px; height: 176px;" />
<pre>
Input: matrix = [[1,0,1],[0,-2,3]], k = 2
Output: 2
Explanation: Because the sum of the blue rectangle [[0, 1], [-2, 3]] is 2, and 2 is the max number no larger than k (k = 2).
</pre>

Example 2:

<pre>
Input: matrix = [[2,2,-1]], k = 3
Output: 3
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>m == matrix.length</code></li>
	<li><code>n == matrix[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 100</code></li>
	<li><code>-100 &lt;= matrix[i][j] &lt;= 100</code></li>
	<li><code>-105 &lt;= k &lt;= 105</code></li>
</ul>

&nbsp;
Follow up: What if the number of rows is much larger than the number of columns?