mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
21 lines
558 B
HTML
21 lines
558 B
HTML
<p>设计一个算法，找出数组中两数之和为指定值的所有整数对。一个数只能属于一个数对。</p>
|
|
|
|
<p><strong>示例 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>输入:</strong> nums = [5,6,5], target = 11
|
|
<strong>输出: </strong>[[5,6]]</pre>
|
|
|
|
<p><strong>示例 2:</strong></p>
|
|
|
|
<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 <= 100000</code></li>
|
|
<li><code>-10^5 <= nums[i], target <= 10^5</code></li>
|
|
</ul>
|