Two Sum-LeetCode

题目：

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

我自己写了一个解法：

是设置了一个结构体存储原下标和相应数值，然后设置该结构体类型的容器并对其进行排序后处理。代码如下：

#include <iostream>
#include <vector>
#include<algorithm>
using namespace std;
typedef struct m_data
{
	int num;
	int index;
}m_data;
bool SortBynum(const m_data &R1,const m_data &R2)//容器的比较函数
{  
	return (R1.num < R2.num);//升序排列   
} 


 vector<int> twoSum(vector<int> &numbers, int target) 
 {
	 vector <m_data> mydata;
	 for (int i = 0; i < numbers.size(); i++)//扫描遍历复制
	 {
		 m_data temp;
		 temp.num = numbers[i];
		 temp.index = i;
		 mydata.push_back(temp);
	 }

	 vector<int> result;
	 sort(mydata.begin(),mydata.end(),SortBynum);  //按升序排列
	 for (int i = 0; i < mydata.size(); i++)
	 {
		cout<<mydata[i].num<<endl;
	 }
	 for (int i = 0; i < mydata.size() - 1; i++)
		 for (int j = i + 1; j < mydata.size(); j++)
		 {
			if ((mydata[i].num + mydata[j].num) == target)//相等时
			{
				if (mydata[i].index > mydata[j].index )
				{
					result.push_back(mydata[j].index);
					result.push_back(mydata[i].index);
				}
				else
				{
					result.push_back(mydata[i].index + 1);
					result.push_back(mydata[j].index + 1);
				}
				cout<<result[0]<<"  "<<result[1];
				return result;
			 }
			if ((mydata[i].num + mydata[j].num) > target)//大于时，直接进入下一次的循环，节约时间成本
			{
				break;
			}
		 }
	
	return result;
 }
//测试用
 int main()
 {
	 vector <int> numbers;
	 numbers.push_back(3);
	 numbers.push_back(2);	
	 numbers.push_back(4);
	 numbers.push_back(9);
	 twoSum(numbers,7);
	 system("pause");
	 return 1;
 }

但是leecode说无法编译sort函数，不知道如何加入#include<algorithm>这个头文件，于是在网上查了下有没有其他解法，找到一个利用map实现的方法，觉得很棒，原文地址：http://blog.csdn.net/pickless/article/details/8995612，代码很短小精悍，也节省了一部分时间复杂度，非常喜欢，记录下来：

代码如下：

#include <iostream>
#include <vector>
#include<algorithm>
#include <map>
using namespace std;


vector<int> twoSum(vector<int> &numbers, int target) 
{
	vector<int> ans;  
	map<int, int> numbersMap;  //key为数值 value为对应的下标+1
	map<int, int>::iterator iter;  
	for (int i = 0; i < numbers.size(); i++) 
	{
		iter = numbersMap.find(target - numbers[i]);  //要找的key
		if (iter != numbersMap.end()) //如果找到
		{  
			ans.push_back(iter->second);  //存储的内容
			ans.push_back(i + 1);  
			break;  
		} 
		else 
		{  
			numbersMap[numbers[i]] = i + 1;  
		}  
	}  
	cout<<ans[0]<<endl<<ans[1];
	return ans;  

}

int main()
{
	vector <int> numbers;
	numbers.push_back(3);
	numbers.push_back(2);	
	numbers.push_back(4);
	
	twoSum(numbers,6);
	system("pause");
	return 1;
}