【LeetCode】167. Two Sum II - Input array is sorted 和为s的两个数字

Difficulty:easy

 More:【目录】LeetCode Java实现

Description

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 exactlyone solution and you may not use the sameelement 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.

Intuition

refer to 和为s的两个数字

Solution

    public int[] twoSum(int[] numbers, int target) {
        if(numbers==null || numbers.length<=1)
            throw new IllegalArgumentException("invalid array!");
        int low=0;
        int high=numbers.length-1;
        while(low<high){
            if(numbers[low]+numbers[high]==target)
                return new int[]{low+1,high+1};
            else if(numbers[low]+numbers[high]<target){
                low++;
            }else if(numbers[low]+numbers[high]>target){
                high--;
            }
        }
        throw new IllegalArgumentException("no such sum");
    }

　　

Complexity

Time complexity : O(n)

Space complexity : O(1)

 

What I've learned

1.The use of two pointers.

 More:【目录】LeetCode Java实现