-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy paththree_sum.py
36 lines (31 loc) · 1.31 KB
/
three_sum.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
import collections as cl
class Solution(object):
def find_nice_idx(self, available_idxs, i, j):
for idx in available_idxs:
if idx != i and idx != j:
return idx
return None
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
num2idx = cl.defaultdict(list)
for i, num in enumerate(nums):
num2idx[num].append(i)
triples = set()
all_triples = set()
for i in range(0, len(nums)):
for j in range(i + 1, len(nums)):
available_idxs = num2idx[0 - nums[i] - nums[j]]
idx = self.find_nice_idx(available_idxs, i, j)
if idx is not None:
if (nums[i], nums[j], nums[idx]) not in all_triples:
triples.add((nums[i], nums[j], nums[idx]))
all_triples.add((nums[i], nums[j], nums[idx]))
all_triples.add((nums[j], nums[i], nums[idx]))
all_triples.add((nums[idx], nums[j], nums[i]))
all_triples.add((nums[idx], nums[i], nums[j]))
all_triples.add((nums[i], nums[idx], nums[j]))
all_triples.add((nums[j], nums[idx], nums[i]))
return triples