Two Sum II - Input array is sorted

最新推荐文章于 2022-04-08 20:13:30 发布

lixq05

最新推荐文章于 2022-04-08 20:13:30 发布

阅读量115

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/lixq05/article/details/79494102

leetcode 专栏收录该内容

61 篇文章

订阅专栏

本文介绍了一种解决有序数组中寻找两个数使其和为目标值的问题的方法。利用双指针技术，从数组两端向中间逼近，高效找到符合条件的元素。这种方法时间复杂度为O(n)，适用于已排序的输入。

题目：

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

解题思路：

利用两个指针，向中间遍历（这里要注意，最后返回结果是两个指针+1之后的结果）

代码：

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        if(numbers==null || numbers.length<=1)
            return null;
        int p = 0;
        int q = numbers.length-1;

        while(p<q){
            int temp = numbers[p]+numbers[q];
            if(temp == target){
                return new int[]{p+1,q+1};
            }else if(temp>target){
                q--;
            }else{
                p++;
            }
        }
        return null;
    }
}