mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
46 lines
1.7 KiB
HTML
46 lines
1.7 KiB
HTML
|
<p>给定一个已按照<strong><em> </em>升序排列 </strong>的整数数组 <code>numbers</code> ，请你从数组中找出两个数满足相加之和等于目标数 <code>target</code> 。</p>
|
|||
|
|
|
|||
|
|
<p>函数应该以长度为 <code>2</code> 的整数数组的形式返回这两个数的下标值<em>。</em><code>numbers</code> 的下标 <strong>从 0 开始计数</strong> ，所以答案数组应当满足 <code>0 <= answer[0] < answer[1] < numbers.length</code> 。</p>
|
|||
|
|
|
|||
|
|
<p>假设数组中存在且只存在一对符合条件的数字，同时一个数字不能使用两次。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>numbers = [1,2,4,6,10], target = 8
|
|||
|
|
<strong>输出：</strong>[1,3]
|
|||
|
|
<strong>解释：</strong>2 与 6 之和等于目标数 8 。因此 index1 = 1, index2 = 3 。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>numbers = [2,3,4], target = 6
|
|||
|
|
<strong>输出：</strong>[0,2]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>numbers = [-1,0], target = -1
|
|||
|
|
<strong>输出：</strong>[0,1]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>2 <= numbers.length <= 3 * 10<sup>4</sup></code></li>
|
|||
|
|
<li><code>-1000 <= numbers[i] <= 1000</code></li>
|
|||
|
|
<li><code>numbers</code> 按 <strong>递增顺序</strong> 排列</li>
|
|||
|
|
<li><code>-1000 <= target <= 1000</code></li>
|
|||
|
|
<li>仅存在一个有效答案</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p>注意：本题与主站 167 题相似（下标起点不同）：<a href="https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/">https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/</a></p>
|