- 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.
java:
class Solution {
public int[] twoSum(int[] numbers, int target) {
int sta = 0;
int end = numbers.length - 1;
while(sta<end){
if(numbers[sta]+numbers[end]==target)
break;
if(numbers[sta]+numbers[end]<target)
sta++;
else
end--;
}
return new int[]{sta+1,end+1};
}
}
python:
class Solution:
def twoSum(self, numbers: List[int], target: int) -> List[int]:
sta = 0
end = len(numbers)-1
while sta<end:
if numbers[sta]+numbers[end] == target:
break
if numbers[sta]+numbers[end] < target:
sta = sta+1
else:
end = end-1
return [sta+1,end+1]