mirror of
https://github.com/ShusenTang/LeetCode.git
synced 2024-09-02 14:20:01 +00:00
000-Two Sum
create 000 Two Sum C++ solution.
This commit is contained in:
parent
e74f7946aa
commit
3809b3369b
16
000-Two Sum/solution.h
Normal file
16
000-Two Sum/solution.h
Normal file
@ -0,0 +1,16 @@
|
|||||||
|
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;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
};
|
Loading…
Reference in New Issue
Block a user