Leetcode 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].

解决方案：

 用hash表保存遍历过的元素，这样可以快速找到和为目标的两个数。

代码：

vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int,int> m;
        if (nums.empty())
            return {};
        
        m[nums[0]] = 0;
        for(int i = 1; i < nums.size(); i++){
            if (m.count(target - nums[i]))
                return {m[target-nums[i]], i};
            
            m[nums[i]] = i;
        }
        
        return {};
 }