这是道比较经典的题目了，这也是leetcode167题，请利用有序的数组这个条件，使用双索引比较好，参考如下 class Solution {     public int[] twoSum(int[] numbers, int target) {         int left=0;         int right=numbers.length-1;         while(left<right){             if(numbers[left]+numbers[right]==target)                 break;                            if(numbers[left]+numbers[right]>target)                 right--;             if(numbers[left]+numbers[right]<target)                 left++;         }         return new int[] {left,right};     } }