LeetCode: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

题意即给出一个数组和一个指定的数字，找出两个数，其和为9。

1、简单暴力解法：使用两个for循环进行遍历，时间复杂度为O(n^2)，会超时，不符合要求。

2、空间换时间的思想，使用一个哈希表，key为某个数字，value为该数字在数组中的索引，首先遍历整个数组一遍，对遍历到的每个数字和其下标存到哈希表中。第二次遍历时，若当前遍历到的数字为a，则到哈希表中取key=sum-a的value，sum即为题意所给的和，若能取到value，则当前数字索引和value值。

代码如下：

class Solution {
public:
vector<int> twoSum(vector<int> &num, int target) {
unordered_map<int, int> mapping;
vector<int> result;
for (int i = 0; i < num.size(); i++) {
mapping[num[i]] = i;
}
for (int i = 0; i < num.size(); i++) {
const int gap = target - num[i];
if (mapping.find(gap) != mapping.end()) {
result.push_back(i + 1);
result.push_back(mapping[gap] + 1);
break;
}
}
return result;
}
};