删除多余的000 Two Sum

000-Two Sum/README.md

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

000-Two Sum/solution.h

@@ -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;  
-        }     
-    }
-};