mirror of
https://github.com/ShusenTang/LeetCode.git
synced 2024-09-02 14:20:01 +00:00
17 lines
439 B
C++
17 lines
439 B
C++
class Solution {
|
|
public:
|
|
vector<int> twoSum(vector<int>& nums, int target) {
|
|
map<int, int>mp;
|
|
vector<int>ans;
|
|
int len = nums.size();
|
|
for(int i = 0; i < len; i++){
|
|
if( mp.find(target - nums[i]) != mp.end()){
|
|
ans.push_back(mp[target - nums[i]]);
|
|
ans.push_back(i);
|
|
return ans;
|
|
}
|
|
mp[nums[i]] = i;
|
|
}
|
|
}
|
|
};
|