[LeetCode]Two Sum II - Input array is sorted

https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/

排序数组、求两者和。显然two pointer。

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] res = {Integer.MIN_VALUE, Integer.MAX_VALUE};
        if (numbers == null || numbers.length <= 1) {
            return res;
        }
        for (int i1 = 0, i2 = numbers.length - 1; i1 < i2;) {
            if (numbers[i1] + numbers[i2] == target) {
                res[0] = i1 + 1;
                res[1] = i2 + 1;
                break;
            } else if (numbers[i1] + numbers[i2] > target) {
                i2--;
            } else {
                i1++;
            }
        }
        return res;
    }
}