哈希表 class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int,int>hash; for(int i=0;i<nums.size();i++){ if(hash.count(target-nums[i]))return {i,hash[target-nums[i]]}; hash[nums[i]]=i; } return {}; } }; //时间复杂度为O(n)