Leetcode第一题--------- Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution.

Example:

Given nums = [2, 7, 11, 15], target = 9,

 

Because nums[0] + nums[1] = 2+ 7 = 9,

return [0, 1].

//题目大意为：给定一个数组和目标数字，若数组中的两个数加起来之和为目标数字，则返回这两个数的下标

#include "stdafx.h"
#include<iostream>
#include<cmath>
#include<vector>
#include<map>
#include<hash_map>
#include<algorithm>
using namespace std;
class solution{
public:
	vector<int> twoSum(vector<int>& nums, int target)
	{
		vector<pair<int, int>> tempNumbers;
		for (int i = 0; i < nums.size(); i++)
			tempNumbers.push_back(make_pair(nums[i], i));
		//给tempNumbers的数据排序
		sort(tempNumbers.begin(), tempNumbers.end(), [](pair<int, int>&l, pair<int, int>&r){return l.first < r.first; });
		int i = 0;
		int j = nums.size() - 1;
		while (i < j)
		{
			//两边夹逼法，判断
			int result = tempNumbers[i].first + tempNumbers[j].first;
			if (result > target)
				j--;
			else if (result < target)
				i++;
			else break;
		}
		return vector<int>{tempNumbers[i].second, tempNumbers[j].second };
	}
};

//以下main函数在VS里面编译的时候要写，在leetcode上提交就不用写了
int main()
{
	

	return 0;
}