難度簡單18
輸入一個遞增排序的數組和一個數字s,在數組中查找兩個數,使得它們的和正好是s。如果有多對數字的和等於s,則輸出任意一對即可。
示例 1:
輸入:nums = [2,7,11,15], target = 9 輸出:[2,7] 或者 [7,2]
示例 2:
輸入:nums = [10,26,30,31,47,60], target = 40 輸出:[10,30] 或者 [30,10]
解題思路:快慢指針比較給力
class Solution {
public int[] twoSum(int[] nums, int target) {
int [] array = new int[2];
int low = 0;
int high = nums.length-1;
int num = nums[high]+nums[low];
while(low<high){
if(num<target){
num -= nums[low];
low++;
num+=nums[low];
}else if(num > target){
num-=nums[high];
high--;
num+=nums[high];
}else{
array[0] = nums[low];
array[1] = nums[high];
return array;
}
}
return null;
}
}