Skip to content

Latest commit

 

History

History
32 lines (19 loc) · 951 Bytes

e0167.md

File metadata and controls

32 lines (19 loc) · 951 Bytes

Two Sum ii: Input Array is Sorted

Question Stem

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:

  1. Your returned answers (both index1 and index2) are not zero-based.
  2. 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.

Source Code

Additional Question

Given an array of integers (not necessarily sorted), find two numbers such that their sum is the closest value to a specific target number.

Source Code