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, 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].
题目链接:https://leetcode.com/problems/two-sum/
解法:map
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int,int> record;
vector<int> res;
for(int i=0;i<nums.size();++i){
int tmp = target-nums[i];
if(record.find(tmp)!=record.end()){
res.push_back(record[tmp]);
res.push_back(i);
break;
}
record[nums[i]] = i;
}
return res;
}
};