mirror of
https://github.com/prdlk/leetcode.git
synced 2026-11-02 13:12:44 +00:00
63 lines
1.7 KiB
Plaintext
63 lines
1.7 KiB
Plaintext
---
|
|
title: '167. Two Sum II - Input Array Is Sorted'
|
|
description: Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length
|
|
sidebar:
|
|
badge: 'Medium'
|
|
---
|
|
|
|
<Badge variant="accent">Two Pointers</Badge>
|
|
|
|
::::warning
|
|
Your solution must use only constant extra space.
|
|
::::
|
|
|
|
### Example 1:
|
|
- 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`. We return `[1, 2]`.
|
|
|
|
### Example 2:
|
|
- Input: `numbers = [2,3,4], target = 6`
|
|
- Output: `[1,3]`
|
|
- Explanation: The sum of `2` and `4` is `6`. Therefore `index1 = 1`, `index2 = 3`. We return `[1, 3]`.
|
|
|
|
### Example 3:
|
|
- Input: `numbers = [-1,0], target = -1`
|
|
- Output: `[1,2]`
|
|
- Explanation: The sum of `-1` and `0` is `-1`. Therefore `index1 = 1`, `index2 = 2`. We return `[1, 2]`.
|
|
|
|
### Constraints:
|
|
|
|
- `2 <= numbers.length <= 3 * 10^4`
|
|
- `-1000 <= numbers[i] <= 1000`
|
|
- `numbers` is sorted in non-decreasing order.
|
|
- `-1000 <= target <= 1000`
|
|
- The tests are generated such that there is exactly one solution.
|
|
|
|
## Solution
|
|
|
|
```js
|
|
/**
|
|
* @param {number[]} numbers
|
|
* @param {number} target
|
|
* @return {number[]}
|
|
*/
|
|
var twoSum = function(numbers, target) {
|
|
let i = 0, j = numbers.length - 1;
|
|
|
|
while (i < j) {
|
|
const curr = numbers[i] + numbers[j];
|
|
if (curr === target){
|
|
return [i + 1, j + 1];
|
|
}else{
|
|
if (curr < target){
|
|
i++;
|
|
}else{
|
|
j--;
|
|
}
|
|
}
|
|
}
|
|
return [];
|
|
};
|
|
```
|