From f426cd64d9e95ac4a1463af0eee55a1ed8fa02f1 Mon Sep 17 00:00:00 2001
From: programmerysa <741437084@qq.com>
Date: Tue, 25 Apr 2017 14:55:16 +0800
Subject: [PATCH] Update three_sum.py

---
 array/three_sum.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/array/three_sum.py b/array/three_sum.py
index 4b5753347..e5486cf93 100644
--- a/array/three_sum.py
+++ b/array/three_sum.py
@@ -3,7 +3,7 @@
 such that a + b + c = 0?
 Find all unique triplets in the array which gives the sum of zero.
 
-Note: The solution set must not contain duplicate triplets.
+Note: The solution set must not    contain duplicate triplets.
 
 For example, given array S = [-1, 0, 1, 2, -1, -4],