小黑代码(java)
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] arr = new int[]{-1,-1};
int before = 0;
int after = nums.length - 1;
while(before != after){
int num = nums[before] + nums[after];
if(num > target){
after--;
}else if(num < target){
before++;
}else{
arr[0] = nums[before];
arr[1] = nums[after];
// System.out.println(arr[0]+" "+arr[1]+' '+num+' '+target);
break;
}
}
return arr;
}
}
小黑代码(python)
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
n = len(nums)
start = 0
end = n -1
while start != end:
if nums[start] + nums[end] < target:
start += 1
elif nums[start] + nums[end] > target:
end -= 1
else:
return [nums[start],nums[end]]
return []
小黑生活