[leetcode]167. Two Sum II - Input array is sorted

最新推荐文章于 2024-10-28 10:58:32 发布

yao_yao_2015

最新推荐文章于 2024-10-28 10:58:32 发布

阅读量209

点赞数

分类专栏： leetcode

leetcode 专栏收录该内容

47 篇文章

订阅专栏

本文介绍了一种在已排序的整数数组中寻找两个数使其和等于特定目标值的有效算法。该算法采用双指针技术，从数组两端开始向中间逼近，直到找到满足条件的两个数，并返回它们的索引。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        vector<int> result;
        int i=0;
        int j = numbers.size()-1;
        
        while((numbers[i]+numbers[j])!=target)
        {
            if((numbers[i]+numbers[j])>target)
                j--;
            else if((numbers[i]+numbers[j])<target)
                i++;
            else
                break;
        }
        
        result.push_back(i+1);
        result.push_back(j+1);
        
        return result;
    }
};