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

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
leetcode-cn/problem (Chinese)/查找和最小的 K 对数字 [qn8gGX].html
View File

@@ -6,7 +6,7 @@
<p>&nbsp;</p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入:</strong> nums1 = [1,7,11], nums2 = [2,4,6], k = 3
@@ -15,7 +15,7 @@
[1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]
</pre>
<p><strong>示例 2:</strong></p>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入: </strong>nums1 = [1,1,2], nums2 = [1,2,3], k = 2
@@ -24,7 +24,7 @@
&nbsp; [1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]
</pre>
<p><strong>示例 3:</strong></p>
<p><strong>示例 3：</strong></p>
<pre>
<strong>输入: </strong>nums1 = [1,2], nums2 = [3], k = 3
@@ -34,7 +34,7 @@
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<p><strong>提示：</strong></p>
<ul>
<li><code>1 &lt;= nums1.length, nums2.length &lt;= 10<sup>4</sup></code></li>