LeetCode刷题——Array篇(寻找两数和)

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

1、一开始想从整个矩阵中寻找数所处的范围,但是测试后发现,这些数相加后,虽然有一定的大小规律,但是之间有重叠,当第7个数为345存在递增关系,但是当为151的时候不存在这种关系
这里写图片描述

2、后来看了答案,两个指针,小了的话,指针前移,大了的话后移,完美解决了这个问题,找到之后,记得break掉;

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


        return new_index;
    }
};
阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页