6、双指针——递增数组两数之和与目标数相等

 public int[] twoSum(int[] nums, int target) {
        int low = 0, high = nums.length-1;
        while(low < high){
           int sum = nums[low] + nums[high];
           if(sum < target) low++;
           else if(sum >target) high--;
           else  return new int[] { nums[low], nums[high]};
        }
        return new int[0];
    }

运行结果：