leetcode-167. Two Sum II - Input array is sorted

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. 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 的元素的下标，要求以数组返回，第一个下标小于第二个下标，且下标从 1 开始

保证数组中存在满足条件的两个数，且一个数字不会用两遍。

思路:

之后要遍历数组找到这两个数即可，一个从0开始，一个从最后开始。

solution:

class Solution {
    public int[] twoSum(int[] numbers, int target) {
            int left = 0;
        	int right = numbers.length - 1;
        	int[] solu = new int[2];

        	while(true){
        		if(target - numbers[left] == numbers[right]) {
        				solu[0] = left + 1;
        				solu[1] = right + 1;
        				return solu;
        		}
        		else if (target - numbers[left] < numbers[right]) {
        			right--;
        		}
        		else left++;
        	}
        	//return solu;
        
    }
}