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[] r=new int[2];
        for(int i=0;i<numbers.length;i++){
			for(int j=i+1;j<numbers.length;j++)
			{
				if(numbers[i]+numbers[j]==target)
                {
                    r[0]=i+1;
                    r[1]=j+1;
                }
			}
        }
        return r;
    }
}

讨论区解法

这个解法关注到了给定的数组是按升序已经排好序，这样解降低了时间复杂度，思路也很清晰

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] r=new int[2];
        int left=0,right=numbers.length-1;
        while(numbers[left]+numbers[right]!=target)
        {
            if(numbers[left]+numbers[right]>target)
                right--;
            else if(numbers[left]+numbers[right]<target)
                left++;
        }
                    r[0]=left+1;
                    r[1]=right+1;
        return r;
    }
}