From c5731cf829a20c91f72185da4435f6cd095110a2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=94=90=E6=A0=91=E6=A3=AE?= <14021051@buaa.edu.cn>
Date: Sun, 15 Jul 2018 21:02:11 +0800
Subject: [PATCH] =?UTF-8?q?=E5=88=A0=E9=99=A4=E5=A4=9A=E4=BD=99=E7=9A=8400?=
 =?UTF-8?q?0=20Two=20Sum?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 000-Two Sum/README.md  |  4 ----
 000-Two Sum/solution.h | 16 ----------------
 2 files changed, 20 deletions(-)
 delete mode 100644 000-Two Sum/README.md
 delete mode 100644 000-Two Sum/solution.h

diff --git a/000-Two Sum/README.md b/000-Two Sum/README.md
deleted file mode 100644
index 4031d5b..0000000
--- a/000-Two Sum/README.md	
+++ /dev/null
@@ -1,4 +0,0 @@
-LeetCode第一个题
-
-# C++
-刚开始用暴力匹配，后来看了答案恍然大悟，hash会快很多
diff --git a/000-Two Sum/solution.h b/000-Two Sum/solution.h
deleted file mode 100644
index 887b092..0000000
--- a/000-Two Sum/solution.h	
+++ /dev/null
@@ -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;  
-        }     
-    }
-};