LeetCode 167. Two Sum II - Input array is sorted

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.

Note:

• Your returned answers (both index1 and index2) are not zero-based.
• You may assume that each input would have exactly one solution and you may not use the same element twice.

Example:

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int l = numbers.length;
        int[] A = new int[2];
        if (l == 2) {
            A[0] = 1;
            A[1] = 2;
            return A;
        }
        for (int i = 0; i < l - 1; i++) {
            int res = target - numbers[i];
            int start = i + 1;
            int end = l - 1;
            while (start < end - 1) {
                int mid = (start + end) / 2;
                if (numbers[mid] > res) {
                    end = mid;
                } else if (numbers[mid] < res) {
                    start = mid;
                } else {
                    A[0] = i + 1;
                    A[1] = mid + 1;
                    break;
                }
            }
            if (res == numbers[end]) {
                A[0] = i + 1;
                A[1] = end + 1;
                break;
            }
            if (res == numbers[start]) {
                A[0] = i + 1;
                A[1] = start + 1;
                break;
            }
        }
        return A;
    }
}

此题并不难，但感觉我上面这种解法兜了大圈子，只能看看别人的如下：

public int[] twoSum(int[] num, int target) {
    int[] indice = new int[2];
    if (num == null || num.length < 2) return indice;
    int left = 0, right = num.length - 1;
    while (left < right) {
        int v = num[left] + num[right];
        if (v == target) {
            indice[0] = left + 1;
            indice[1] = right + 1;
            break;
        } else if (v > target) {
            right --;
        } else {
            left ++;
        }
    }
    return indice;

by titanduan3

别人真是神