1. Two Sum

xiaoxiao2021-02-28  32

Two Sum

class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int,int> map; vector<int> res; if(nums.empty()) return res; for(int i=0;i<nums.size();i++){ if(map.find(target-nums[i])==map.end()){ map[nums[i]]=i; } else{ res.push_back(map[target-nums[i]]); res.push_back(i); return res; } } } };
转载请注明原文地址: https://www.6miu.com/read-2626617.html

最新回复(0)