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. Please note that 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.
- Input: numbers={2, 7, 11, 15}, target=9
- Output: index1=1, index2=2
其实这个解法还可以在优化,因为数组是有序的这个条件还没有用上呢。
但是这样子嵌套循环也是可行的。
/**
* @param {number[]} numbers
* @param {number} target
* @return {number[]}
*/
var twoSum = function(numbers, target) {
var temp=[];
for(var i=0;i<numbers.length-1;i++){
for(var j=i+1;j<numbers.length;j++){
if(numbers[i]+numbers[j]==target){
return [i+1,j+1];
}
}
}
};