###### Two sum

Given an array of integers, 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

class Solution {
private:
map<int,int> mp;
public:
vector<int> twoSum(vector<int>& nums, int target) {
// 注意return的序号从1开始
// 想法比较巧妙:主要思想映射
int index1=-1,index2=-1;
for(int i=0;i<nums.size();++i){
if(mp.find(nums[i])==mp.end()){
mp.insert(make_pair(target-nums[i],nums[i]));
}
else{
if(mp.find(nums[i])->second==target-nums[i]){
index2=i;
break;
}
else mp.insert(make_pair(target-nums[i],nums[i]));
}
}
for(int i=0;i<nums.size();++i){
if(nums[index2]+nums[i]==target){
index1=i;
break;
}
}
return {index1+1,index2+1};
}
};

#### Two Sum -- LeetCode

2014-02-22 23:11:50

#### leetcode－1. Two Sum－简单的算法题，面试见到了吗？

2016-09-17 12:11:51

#### 1. Two Sum（重要！）

2016-07-09 16:21:27

#### LeetCode || Two Sum

2014-04-09 23:11:47

#### 1. Two Sum [easy] (Python)

2016-07-26 20:19:37

#### 算法系列--Two Sum

2015-09-13 23:34:12

#### LeetCode 第 371 题 （Sum of Two Integers）

2016-07-01 19:56:30

#### 【LeetCode】LeetCode——第1题：Two Sum

2016-01-04 17:01:58

#### 167. Two Sum II - Input array is sorted [medium] (Python)

2016-08-31 19:33:40

#### LeetCode 1 Two Sum 排序后快速求解

2015-07-11 11:48:14

Two sum