码迷,mamicode.com
首页 > 其他好文 > 详细

Two Sum II

时间:2016-09-19 06:38:25      阅读:89      评论:0      收藏:0      [点我收藏+]

标签:

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.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

 

 1 class Solution {
 2 public:
 3     vector<int> twoSum(vector<int>& numbers, int target) {
 4         vector<int> indexes;
 5         if (numbers.size() < 2) return indexes;
 6         
 7         int left = 0, right = numbers.size() - 1;
 8         while (left < right) {
 9             if (numbers[left] + numbers[right] > target)
10                 right--;
11             else if (numbers[left] + numbers[right] < target)
12                 left++;
13             else {
14                 indexes.push_back(left + 1);
15                 indexes.push_back(right + 1);
16                 break;
17             }
18         }
19         return indexes;
20     }
21 };

 

Two Sum II

标签:

原文地址:http://www.cnblogs.com/amazingzoe/p/5883689.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!