LeetCode-1:两数之和

使用map减小时间复杂度

class Solution {
public:
    vector twoSum(vector& nums, int target) {
        unordered_map record;
        for(int i=0;i(tmp,tmp+2);
            }                            
            record[nums[i]] = i;
        }
        return vector();
    }
};