LeetCode – 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

典型的双指针,不多说了

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] result = new int[2];
        int h= 0;
        int l = numbers.length -1;
        while(h<numbers.length && l>0 && l>h){
            if(numbers[l]> target){
                l--;
                break;
            }
            if(numbers[h] + numbers[l] == target){
                result[0] =h+1;
                result[1] = l+1;
                return result;
            }
            if(numbers[h] + numbers[l] < target){
                h++;
            }
            else{
                l--;
            }
        }
        return result;
    }
}

邮件订阅,随时获取更新信息

发表评论

电子邮件地址不会被公开。

This site uses Akismet to reduce spam. Learn how your comment data is processed.