Open Tcdian opened 3 years ago
/**
* @param {number[]} numbers
* @param {number} target
* @return {number[]}
*/
var twoSum = function(numbers, target) {
let left = 0;
let right = numbers.length - 1;
while(left < right) {
if (numbers[left] + numbers[right] === target) {
return [left + 1, right + 1];
} else if (numbers[left] + numbers[right] < target) {
left++;
} else {
right--;
}
}
return [-1, -1];
};
function twoSum(numbers: number[], target: number): number[] {
let left = 0;
let right = numbers.length - 1;
while(left < right) {
if (numbers[left] + numbers[right] === target) {
return [left + 1, right + 1];
} else if (numbers[left] + numbers[right] < target) {
left++;
} else {
right--;
}
}
return [-1, -1];
};
167. Two Sum II - Input array is sorted
给定一个已按照 升序排列 的有序数组,找到两个数使得它们相加之和等于目标数。
函数应该返回这两个下标值
index1
和index2
,其中index1
必须小于index2
。Note
Example