committed from zkp

pythonkd · pythonkd · commit f33a26fcff4a · 2018-11-23T10:57:19.000+08:00
diff --git a/LeetCode/TwoSum_1.py b/LeetCode/TwoSum_1.py
@@ -0,0 +1,29 @@
+class Solution:
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        s = sorted(nums)
+        l = 0
+        r = len(s) - 1
+
+        while l < r:
+            t = s[r] + s[l]
+            if t == target:
+                al = s[l]
+                ar = s[r]
+                break
+            elif t > target:
+                r -= 1
+                if l < r and s[r] == s[r + 1]:
+                    r -= 1
+            else:
+                l += 1
+                if l < r and s[l] == s[l - 1]:
+                    l += 1
+        l = nums.index(al)
+        nums.reverse()
+        r = len(nums) - 1 - nums.index(ar)
+        return sorted([l, r])
