力扣leetcode 167. 两数之和 II - 输入有序数组 java

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int index1 = 0, index2 = numbers.length - 1;
        while(index1 < index2 && numbers[index1] + numbers[index2] != target) {
            if(numbers[index1] + numbers[index2] > target) index2--;
            else index1++;
        }
        return new int[] {index1+1, index2+1};
    }
}

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        for(int i=0; i<numbers.length-1; i++)
            for(int j=i+1; j<numbers.length; j++)
                if(numbers[i] + numbers[j] == target)
                    return new int[] {i+1, j+1};
        return new int[] {0, 0};
    }
}