1 Two Sum （数组）

https://leetcode.com/problems/two-sum/description/

在一个数组中，找出2个数的和等于给定的数。直接用map映射即可。

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