ziyang_li/LeetCode
1
0
Fork 0
mirror of https://github.com/ShusenTang/LeetCode.git synced 2024-09-02 14:20:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

删除多余的000 Two Sum

Browse Source
This commit is contained in:
唐树森 2018-07-15 21:02:11 +08:00
parent 6dad930360
commit c5731cf829
2 changed files with 0 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
000-Two Sum/README.md
View File

@ -1,4 +0,0 @@
LeetCode第一个题
# C++
刚开始用暴力匹配，后来看了答案恍然大悟，hash会快很多

16
000-Two Sum/solution.h
View File

@ -1,16 +0,0 @@
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;
}
}
};