[Leecode 1] 两数之和

哈希表 $O(log_2n)$

---

点击查看代码

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

---