Two Sum（两数之和）

【链接】‌https://leetcode-cn.com/problems/add-two-numbers/

 

题目：

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]

 

思路：

注意点1：-109 <= nums[i] <= 109 ，这里限制了必须考虑负数的情况，单纯依靠快排的思路不可行。

‌

题解：

在进行迭代并将元素插入到表中的同时，我们还会回过头来检查表中是否已经存在当前元素所对应的目标元素。如果它存在，那我们已经找到了对应解，并立即将其返回

 

代码：

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> res;
        std::map<int,int> m;
        for(int i = 0; i < nums.size();++i){
            if(m.count(target - nums[i])>0){
                res.push_back(i);
                res.push_back(m[target - nums[i]]);
                break;
            }
            m[nums[i]] = i;
        }
        return res;
    }
};