Class Solution
-
- All Implemented Interfaces:
public final class Solution167 - Two Sum II - Input Array Is Sorted\.
Medium
Given a 1-indexed array of integers
numbersthat is already sorted in non-decreasing order , find two numbers such that they add up to a specifictargetnumber. Let these two numbers be <code>numbersindex<sub>1</sub></code> and <code>numbersindex<sub>2</sub></code> where <code>1 <= index<sub>1</sub>< index<sub>2</sub><= numbers.length</code>.Return the indices of the two numbers, <code>index<sub>1</sub></code> and <code>index<sub>2</sub></code>, added by one as an integer array <code>index<sub>1</sub>, index<sub>2</sub></code> of length 2.
The tests are generated such that there is exactly one solution. You may not use the same element twice.
Your solution must use only constant extra space.
Example 1:
Input: numbers = <ins>2</ins>,<ins>7</ins>,11,15, target = 9
Output: 1,2
Explanation: The sum of 2 and 7 is 9. Therefore, index<sub>1</sub> = 1, index<sub>2</sub> = 2. We return 1, 2.
Example 2:
Input: numbers = <ins>2</ins>,3,<ins>4</ins>, target = 6
Output: 1,3
Explanation: The sum of 2 and 4 is 6. Therefore index<sub>1</sub> = 1, index<sub>2</sub> = 3. We return 1, 3.
Example 3:
Input: numbers = <ins>\-1</ins>,<ins>0</ins>, target = -1
Output: 1,2
Explanation: The sum of -1 and 0 is -1. Therefore index<sub>1</sub> = 1, index<sub>2</sub> = 2. We return 1, 2.
Constraints:
<code>2 <= numbers.length <= 3 * 10<sup>4</sup></code>
-1000 <= numbers[i] <= 1000numbersis sorted in non-decreasing order.-1000 <= target <= 1000The tests are generated such that there is exactly one solution.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-