Update 0015.三数之和.md

增加了Python3的双指针法

problems/0015.三数之和.md

@@ -218,8 +218,32 @@ class Solution {
 ```
 
 Python：
-
+```class Solution:
-
+    def threeSum(self, nums):
+        ans = []
+        n = len(nums)
+        nums.sort()
+        for i in range(n):
+            left = i + 1
+            right = n - 1
+            if nums[i] > 0:
+                break
+            if i >= 1 and nums[i] == nums[i - 1]:
+                continue
+            while left < right:
+                total = nums[i] + nums[left] + nums[right]
+                if total > 0:
+                    right -= 1
+                elif total < 0:
+                    left += 1
+                else:
+                    ans.append([nums[i], nums[left], nums[right]])
+                    while left != right and nums[left] == nums[left + 1]: left += 1
+                    while left != right and nums[right] == nums[right - 1]: right -= 1
+                    left += 1
+                    right -= 1
+        return ans
+```
 Go：
 ```Go
 func threeSum(nums []int)[][]int{