167. Two Sum II - Input array is sorted [LeetCode]

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. Please note that 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.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

题目要求，在一个给定的升序序列中，找出两个数，相加等于target。返回这两个数在数组中的序列号数组。

思路简析：设置两个指针，分别从头和尾向中间靠。如果两指针对应位置的数之和大于target，较小指针向中间走一步；如果和小于target，较大指针向中间走一步；当和与target相等时，返回此时的两个序列号。如果当两指针相遇时仍未发现符合要求的两个位置，则返回null。

具体的java代码如下：

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        if ((numbers == null) || (numbers.length == 1)) return null;
        int i = 0, j = numbers.length-1;
        while (i
    
    
     
      target) j--;
            else if (x == target) return new int[]{i+1, j+1};
        }
        return null;
    }
}