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].
翻译:四级还没过,可悲!
大概意思:给一个整形数组,(indices用有道翻译为指数,但是从例子可以看出return 的是下标)数组中两个元素相加等于目标(target),返回数组下标。
每次输入的数组中会有一个完全的解决方案,就是说数组中至少一组数相加等于target,每个元素element只能使用一次。
第一次刷LeetCode,感觉上面的题真的比PAT好太多了;借鉴一位大神的,他们的时间复杂度真优,努力!
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> m;
vector<int> v;
for(int i = 0; i < nums.size(); i++){
int n = target - nums[i];
if(m.find(n) != m.end()){
v.push_back(m[n]);
v.push_back(i);
break;
}
else
m[nums[i]] = i;
}
return v;
}
};