coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 12:06:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
leetcode-cn/problem (English)/数对和(English) [pairs-with-sum-lcci].html Normal file
View File

@@ -0,0 +1,19 @@
<p>Design an algorithm to find all pairs of integers within an array which sum to a specified value.</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</strong> nums = [5,6,5], target = 11
<strong>Output: </strong>[[5,6]]</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong>Input:</strong> nums = [5,6,5,6], target = 11
<strong>Output: </strong>[[5,6],[5,6]]</pre>
<p><strong>Note: </strong></p>
<ul>
<li><code>nums.length &lt;= 100000</code></li>
</ul>