mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
22 lines
879 B
HTML
22 lines
879 B
HTML
<p>Given an NxM matrix of positive and negative integers, write code to find the submatrix with the largest possible sum.</p>
|
|
|
|
<p>Return an array <code>[r1, c1, r2, c2]</code>, where <code>r1</code>, <code>c1</code> are the row number and the column number of the submatrix's upper left corner respectively, and <code>r2</code>, <code>c2</code> are the row number of and the column number of lower right corner. If there are more than one answers, return any one of them.</p>
|
|
|
|
<p><b>Note: </b>This problem is slightly different from the original one in the book.</p>
|
|
|
|
<p><strong>Example:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:
|
|
</strong><code>[
|
|
[-1,<strong>0</strong>],
|
|
[0,-1]
|
|
]</code>
|
|
<strong>Output: </strong>[0,1,0,1]</pre>
|
|
|
|
<p><strong>Note: </strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= matrix.length, matrix[0].length <= 200</code></li>
|
|
</ul>
|