mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 19:31:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
17
算法题(国内版)/problem (Chinese)/数对和 [pairs-with-sum-lcci].html
Normal file
17
算法题(国内版)/problem (Chinese)/数对和 [pairs-with-sum-lcci].html
Normal file
@@ -0,0 +1,17 @@
|
||||
<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>
|
||||
</ul>
|
Reference in New Issue
Block a user