From 9725e303fdf3b7c864abc6f5b0664d6cce325966 Mon Sep 17 00:00:00 2001
From: superCman <247321025@qq.com>
Date: Wed, 4 Jul 2018 21:39:43 +0800
Subject: [PATCH 1/3] Create Two sum

---
 Two sum | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 Two sum

diff --git a/Two sum b/Two sum
new file mode 100644
index 0000000..c77b7b6
--- /dev/null
+++ b/Two sum	
@@ -0,0 +1,16 @@
+1.Two sum
+Given nums = [2, 7, 11, 15], target = 9,
+
+Because nums[0] + nums[1] = 2 + 7 = 9,
+return [0, 1].
+
+Python:
+class solution(object)
+  def twoSum(self,nums,target):
+		self.nums = nums
+		self.target = target
+		for indic, i in enumerate(self.nums):
+			for indic_b in range(indic + 1, len(nums)):
+				if (i + nums[indic_b] == self.target):
+					print([indic, indic_b])
+					return ([indic, indic_b])

From d794ba3cd04117c645614a26b0417dbac813527d Mon Sep 17 00:00:00 2001
From: superCman <247321025@qq.com>
Date: Wed, 4 Jul 2018 21:40:55 +0800
Subject: [PATCH 2/3] Update Two sum

---
 Two sum | 13 ++++++-------
 1 file changed, 6 insertions(+), 7 deletions(-)

diff --git a/Two sum b/Two sum
index c77b7b6..a3bb2d8 100644
--- a/Two sum	
+++ b/Two sum	
@@ -7,10 +7,9 @@ return [0, 1].
 Python:
 class solution(object)
   def twoSum(self,nums,target):
-		self.nums = nums
-		self.target = target
-		for indic, i in enumerate(self.nums):
-			for indic_b in range(indic + 1, len(nums)):
-				if (i + nums[indic_b] == self.target):
-					print([indic, indic_b])
-					return ([indic, indic_b])
+	self.nums = nums
+	self.target = target
+	for indic, i in enumerate(self.nums):
+		for indic_b in range(indic + 1, len(nums)):
+			if (i + nums[indic_b] == self.target):
+				return ([indic, indic_b])

From 0169357ac8f0ecf2df88c3794bad900552a60701 Mon Sep 17 00:00:00 2001
From: superCman <247321025@qq.com>
Date: Wed, 4 Jul 2018 21:44:43 +0800
Subject: [PATCH 3/3] Update Two sum

---
 Two sum | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Two sum b/Two sum
index a3bb2d8..d41dbd5 100644
--- a/Two sum	
+++ b/Two sum	
@@ -4,7 +4,7 @@ Given nums = [2, 7, 11, 15], target = 9,
 Because nums[0] + nums[1] = 2 + 7 = 9,
 return [0, 1].
 
-Python:
+##Python代码:
 class solution(object)
   def twoSum(self,nums,target):
 	self.nums = nums
@@ -13,3 +13,5 @@ class solution(object)
 		for indic_b in range(indic + 1, len(nums)):
 			if (i + nums[indic_b] == self.target):
 				return ([indic, indic_b])
+
+##C++代码:使用哈希表,时间复杂度为o(n)