leetcode1.两数之和（简单）

思路1：hash

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
		unordered_map<int, int> mp;
        for (int i = 0; i < nums.size(); ++i) {
            if (mp.count(target - nums[i])) {
                return {mp[target - nums[i]], i};
            }else mp.insert({nums[i], i});
        }
        return {};
    }
};