167. Two Sum II - Input array is sorted
https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/
https://workat.tech/problem-solving/practice/two-sum-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.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public int[] twoSum(int[] numbers, int target) { | |
| int lo = 0, hi = numbers.length - 1; | |
| while (lo < hi) { | |
| if (numbers[lo] + numbers[hi] < target) { | |
| lo++; | |
| } else if (numbers[lo] + numbers[hi] > target){ | |
| hi--; | |
| } else { | |
| return new int[] {lo + 1, hi + 1}; | |
| } | |
| } | |
| return new int[] {-1, -1}; | |
| } | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution: | |
| def twoSum(self, numbers: List[int], target: int) -> List[int]: | |
| lo, hi = 0, len(numbers) - 1 | |
| while lo <= hi: | |
| sum = numbers[lo] + numbers[hi] | |
| if sum == target: | |
| return [lo + 1, hi + 1] | |
| if sum < target: | |
| lo += 1 | |
| else: | |
| hi -= 1 | |
| return [-1, -1] |
