两数之和 || - 输入有序数组
题目:
给定一个已按照升序排列 的有序数组,找到两个数使得它们相加之和等于目标数。
函数应该返回这两个下标值 index1 和 index2,其中 index1 必须小于 index2。
说明:
返回的下标值(index1 和 index2)不是从零开始的。
你可以假设每个输入只对应唯一的答案,而且你不可以重复使用相同的元素。
示例:
输入: numbers = [2, 7, 11, 15], target = 9
输出: [1,2]
解释: 2 与 7 之和等于目标数 9 。因此 index1 = 1, index2 = 2 。
The question:
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.
解题思路:
既然题目给了是求有序数组中,两个数之和等于给定的一个target,那么我们就要双指针的方法解决,左指针i初始指向最小值,右指针j=numbers.length-1,不断将左右指针的和与target对比并调整i与j之间的距离直到找到与target相等。
代码实现:
public class Solution
{
public int[] TwoSum(int[] numbers, int target)
{
int i=0;
int j=numbers.Length-1;
while(i<j)
{
if(numbers[i]+numbers[j]==target)
{
return new int[]{i+1,j+1};
}
else if(numbers[i]+numbers[j]<target)
{
i++;
}
else
{
j--;
}
}
return new int[]{-1,-1};
}
}
运行结果: