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 {
public:
	vector<int> twoSum(vector<int> &numbers, int target) {
		vector<int> res;
		if (numbers.size() < 2) return res;
		vector<pair<int, int> > temp;
		for (int i = 0; i < numbers.size(); ++i)
		{
			temp.push_back(make_pair(numbers[i], i + 1));
		}
		sort(temp.begin(), temp.end(), cmp);
		int i = 0, j = temp.size() - 1;
		while (i < j)
		{
			if (temp[i].first + temp[j].first == target)
			{
				res.push_back(temp[i].second);
				res.push_back(temp[j].second);
				break;
			}
			else if (temp[i].first + temp[j].first > target)
			{
				--j;
			}
			else
			{
				++i;
			}
		}
		sort(res.begin(), res.end());
		return res;
	}

	static bool cmp(const pair<int, int>  &v1, const pair<int, int> &v2)
	{
		return v1.first < v2.first;
	}
};