167. 两数之和 II - 输入有序数组

package leetcode;

public class demo_167 {
    public int[] twoSum(int[] numbers, int target) {
        int[] num=new int[2];
        int i=0,j=numbers.length-1;
        while(i<j) {
            //双指针
            if(numbers[i]+numbers[j]==target) {
                num[0]=i+1;
                num[1]=j+1;
                break;
            }
            //如果两数之和大于target，则说明是右数大
            if(numbers[i]+numbers[j]>target) {
                j=j-1;
            }
            //如果两数之和小于target，则说明是左数小
            if(numbers[i]+numbers[j]<target) {
                i=i+1;
            }
        }
        for(int n:num) {
            System.out.println(n);
        }
        return num;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        demo_167 d167=new demo_167();
        int[] numbers= {2,3,5,7,8,11,15};
        int target=12;
        d167.twoSum(numbers, target);
    }

}