Skip to content

Latest commit

 

History

History
74 lines (54 loc) · 2.31 KB

0167-two-sum-ii-input-array-is-sorted.adoc

File metadata and controls

74 lines (54 loc) · 2.31 KB
Raw

167. Two Sum II - Input array is sorted

{leetcode}/problems/two-sum-ii-input-array-is-sorted/[LeetCode - Two Sum II - Input array is sorted^]

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.

Note:

  • Your returned answers (both index1 and index2) are not zero-based.

  • You may assume that each input would have exactly one solution and you may not use the same element twice.

Example:
Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

思路分析

利用输入数组的有序性，可以从两边向中级"挤压"来查找正确解。

{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
一刷
link:{sourcedir}/_0167_TwoSumIIInputArrayIsSorted.java[role=include]
二刷
link:{sourcedir}/_0167_TwoSumIIInputArrayIsSorted_2.java[role=include]
三刷
link:{sourcedir}/_0167_TwoSumIIInputArrayIsSorted_3.java[role=include]