add something, i did some time ago. Dont remember what it is

Author: Dima Koss

py3/medium/3closest/3closest.py

@@ -0,0 +1,28 @@
+class Solution:
+    def __init__(self):
+        pass
+
+    def findClosest(self, target, nums):
+        lf, rg = 0, len(nums) - 1
+        while lf < rg:
+            md = lf + (rg - lf) / 2
+            if abs(nums[md] - target) < abs(nums[lf] - target):
+                lf = md + 1
+            else:
+                rg = md - 1
+
+        if abs(nums[lf] - target) > abs(nums[rg] - target):
+            return nums[rg]
+        return nums[lf]
+
+    def threeSumClosest(self, nums, target):
+        closest, closest_sum = list(), 100 * 1000
+        nums = sorted(nums)
+        for i1, num1 in enumerate(nums):
+            for i2, num2 in enumerate(nums[i1+1:]):
+                desired = target - num1 - num2
+                closest_third = self.findClosest(desired, nums[i1 + i2 + 1:])
+                if abs(closest_third + num1 + num2 - target) < closest_sum:
+                    closest_sum = abs(closest_third + num1 + num2 - target)
+                    closest_third = [num1, num2, closest]
+        return closest_sum

py3/medium/3sum/3sum.py

@@ -0,0 +1,52 @@
+import collections
+
+
+class Solution:
+    def __init__(self):
+        self.triples = list()
+
+    def count(self, nums):
+        ns = collections.defaultdict(list)     # num to the list of it's indexes
+        for place, n in enumerate(nums):
+            ns[n].append(place)
+        return ns
+
+    def threeSum(self, nums):
+        ns = self.count(nums)
+        used = set()
+        for i1, num1 in enumerate(nums):
+            for i2, num2 in enumerate(nums[i1 + 1:]):
+                if (
+                    -(num1 + num2) in ns and
+                    # no duplicated
+                    (num1, num2, -(num1 + num2)) not in used and (
+                        len(ns[-(num1 + num2)]) > 2 or
+                        (
+                            # checking not the same numbers
+                            ns[-(num1 + num2)] != [i1, i2 + i1 + 1] and
+                            ns[-(num1 + num2)] != [i2 + i1 + 1, i1] and
+                            ns[-(num1 + num2)] != [i1] and
+                            ns[-(num1 + num2)] != [i2 + i1 + 1]
+                        )
+                    )
+                ):
+                    self.triples.append([num1, num2, -(num1 + num2)])
+                    tn = -(num1 + num2)
+                    used.add((num1, num2, tn))
+                    used.add((num2, num1, tn))
+                    used.add((num1, tn, num2))
+                    used.add((num2, tn, num1))
+                    used.add((tn, num1, num2))
+                    used.add((tn, num2, num1))
+        return self.triples
+
+
+
+def main(nums):
+    return Solution().threeSum(ns)
+
+def get_input(inp):
+    return [int(x) for x in nums.split()]
+
+def format_output(triples):
+    pass