【解题思路】
设置两个指针i,j,分别指向数组左右两端,如果nums[i] + nums[j] > target,j指针向左移动;反之i指针向右移动,直到 nums[i] + nums[j] = target。
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] ans = new int[2];
int len = nums.length;
int i = 0, j = len - 1;
while(nums[i] + nums[j] != target)
{
if(nums[i] + nums[j] > target)
{
j--;
}
else
{
i++;
}
}
ans[0] = nums[i];
ans[1] = nums[j];
return ans;
}
}