coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-13 01:15:14 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
leetcode-cn/problem (Chinese)/数对和 [pairs-with-sum-lcci].html
View File

@@ -1,20 +1,20 @@
<p>设计一个算法，找出数组中两数之和为指定值的所有整数对。一个数只能属于一个数对。</p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入:</strong> nums = [5,6,5], target = 11
<strong>输出: </strong>[[5,6]]</pre>
<strong>输入：</strong>nums = [5,6,5], target = 11
<strong>输出：</strong>[[5,6]]</pre>
<p><strong>示例 2:</strong></p>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入:</strong> nums = [5,6,5,6], target = 11
<strong>输出: </strong>[[5,6],[5,6]]</pre>
<strong>输入：</strong>nums = [5,6,5,6], target = 11
<strong>输出：</strong>[[5,6],[5,6]]</pre>
<p><strong>提示：</strong></p>
<ul>
<li><code>nums.length &lt;= 100000</code></li>
<li><code>-10^5 &lt;= nums[i], target &lt;= 10^5</code></li>
<li><code>-10<sup>5</sup> &lt;= nums[i], target &lt;= 10<sup>5</sup></code></li>
</ul>