双指针 class Solution { public int[] twoSum(int[] nums, int target) { int i = 0, j = nums.length - 1, res; while (i < j) { res = nums[i] + nums[j]; if (res == target) return new int[]{nums[i], nums[j]}; else if (res > target) j--; else i++; } return new int[0]; } } 注:本来想了二分法,测试过后发现在效率上还比不上双指针!