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