mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-11 18:31:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -2,16 +2,19 @@
|
||||
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong> nums = [5,6,5], target = 11
|
||||
<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
|
||||
<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>
|
||||
|
Reference in New Issue
Block a user