leetcode 刷题之路 7 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

这道题可以分解为两个部分，一个为寻找升序数组中和为某个值的两个元素，这个问题已经在这篇文章中解答过了，另外一个就是记录这两个数字对应下标的问题。我采用pair类将每个数字和其对应的下标值合并存储。得到一个pair<int,int>类型的数组。具体的做法为，对这个数组按照数字大小进行稳定的排序，这一步直接采用STL中的stable_sort实现，在这个有序数组的基础上再使用上面文章链接里面给出的方法求出两个元素，从而也获得了对应的下标，问题解决。

my accepted answer:

bool cmp(pair<int, int> pii1, pair<int, int> pii2)
{
	return pii1.first < pii2.first;
}
class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) 
    {
        vector<pair<int, int>> vpii;
		for (int i = 0; i < numbers.size(); i++)
			vpii.push_back(pair<int,int>(numbers[i], i));
		
		stable_sort(vpii.begin(), vpii.end(), cmp);

		vector<int> vi;
		int i = 0, j = vpii.size() - 1;
		while (i < j)
		{
			if (vpii[i].first + vpii[j].first == target)
			{
		 		vi.push_back(vpii[i].second+1);
				vi.push_back(vpii[j].second + 1);
				sort(vi.begin(), vi.end());
				break;
			}
			else if (vpii[i].first + vpii[j].first>target)
				j--;
			else i++;
		}
		return vi;
    }
};