Difficulty:easy

 More:

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 = 9Output: [1,2]Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

Intuition

refer to 

 

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
     
      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: