leetcode算法题--两数之和

题目地址：https://leetcode-cn.com/problems/two-sum/

vector<int> twoSum(vector<int>& nums, int target) {
    map<int, int> mp;
    int n = nums.size();
    for (int i = 0; i < n; i++) {
        int tmp = target - nums[i];
        if (mp.count(tmp)) {
            return {mp[tmp], i};
        } else {
            mp[nums[i]] = i;
        }
    }
    return {};
}