1. 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].
思路:
1、不能对该数组作任何预处理。因为要求返回是原始数组的下标,如果对数组进行了排序,那么下标就会乱,所以要想进行排序后利用二分查找的方法进行求和到目标值(参照Leetcode的18. 4Sum解法)需要先设计相应的数据结构来存储相应值得下标。
2、 很容易想到用pair<value, index>的映射表遍历numbers,在映射表中寻找target-numbers[i].若找到则结束,返回存储的下标和当前下标,若找不到则将<numbers[i], i>加入映射表。 这里实现hashmap用的是unordered_map,因为unordered_map不会进行关键字的排序,相对于map效率高一些。
#include <vector>
#include <unordered_map>
#include <iostream>
using namespace std;
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> res;
unordered_map<int, int> hash;
for (int i = 0; i < nums.size(); i++)
{
if (hash.find(target-nums[i])==hash.end())
{
hash[nums[i]] = i;
}
else {
res.push_back(hash[target - nums[i]]);
res.push_back(i);
return res;
}
}
}
};
int main()
{
vector<int> nums = { 2, 7, 11,7,15,7 };
int target = 14;
Solution s;
auto re = s.twoSum(nums, target);
return 0;
}