# leetcode001

## 两和

#### 问题描述

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, and you may not use the same element twice.

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

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


给定nums = [2，7，11，15]，target = 9，


• 法一
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int>result;
for (int i=0; i<nums.size(); i++)
{
for (int j=i+1; j<nums.size(); j++)
{
if (nums[i]+nums[j] == target)
{
result.push_back(i);
result.push_back(j);
break;
}
}
}
return result;
}
};
• 法二
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
map<int, int> mapping;
vector<int> result;
for (int i = 0; i < nums.size(); i++)
{
mapping[nums[i]] = i;
}
for (int i = 0; i < nums.size(); i++)
{
int searched = target - nums[i];
if ( mapping.at(searched) != i)
{
result.push_back(i);
result.push_back(mapping[searched]);
break;
}
}
return result;
}
};