首页 > 学院 > 开发设计 > 正文

Leetcode 167. Two Sum II - Input array is sorted

2019-11-11 03:19:15
字体:
来源:转载
供稿:网友

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

s思路: 1. 排好序的情况,说明不考虑map,但可以用two pointer:左边一个、右边一个,往中间走! 2. two pointer对排好序的情况,很好用!

class Solution {public: vector<int> twoSum(vector<int>& numbers, int target) { // int l=0,r=numbers.size()-1; while(l<r){ if(numbers[l]+numbers[r]==target) break; if(numbers[l]+numbers[r]<target){ l++; }else r--; } //return {l++,r++};//bug:应该先++ return {++l,++r}; }};
发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表