coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/find-valid-matrix-given-row-and-column-sums.html
View File

@@ -5,7 +5,7 @@
<p>Return <em>a 2D array representing <strong>any</strong> matrix that fulfills the requirements</em>. It&#39;s guaranteed that <strong>at least one </strong>matrix that fulfills the requirements exists.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> rowSum = [3,8], colSum = [4,7]
@@ -21,7 +21,7 @@ Another possible matrix is: [[1,2],
[3,5]]
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> rowSum = [5,7,10], colSum = [8,6,8]
@@ -36,5 +36,5 @@ Another possible matrix is: [[1,2],
<ul>
<li><code>1 &lt;= rowSum.length, colSum.length &lt;= 500</code></li>
<li><code>0 &lt;= rowSum[i], colSum[i] &lt;= 10<sup>8</sup></code></li>
<li><code>sum(rows) == sum(columns)</code></li>
<li><code>sum(rowSum) == sum(colSum)</code></li>
</ul>