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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
#!/usr/bin/env python3
###########################################################################
# script name: ch-1.py #
# #
# https://github.com/user-person #
# #
# https://perlweeklychallenge.org/blog/perl-weekly-challenge-051/ #
# #
# 3 Sum #
# Given an array @L of integers. Write a script to find all unique #
# triplets such that a + b + c is same as the given target T. Also make #
# sure a <= b <= c. #
# #
# https://en.wikipedia.org/wiki/3SUM #
# #
# Example: #
# #
# @L = (-25, -10, -7, -3, 2, 4, 8, 10); #
# #
# One such triplet for target 0 i.e. -10 + 2 + 8 = 0. #
# #
###########################################################################
import re
import sys
L = [-25, -10, -7, -3, 2, 4, 8, 10]
T = 0
if len(sys.argv) > 1:
input = ' '.join(sys.argv[1:])
input = re.sub(r'[][)(, ]+', ' ', input)
input = re.sub(r'\A\s+|\s+\Z', '', input)
L = re.split(r' ', input)
for num in L:
num = re.sub(r'\A0+\Z', '0', num)
numPat = re.compile(r'\A0+(-?\d+)')
num = re.sub(numPat, r'\1', num)
L = list(map(int,L))
else:
print('Using default input L:',L)
L.sort()
seen = {}
for i in range( len(L)-2):
for j in range(i+1, len(L)-1):
for k in range(j+1, len(L) ):
sum = L[i] + L[j] + L[k]
if sum == T:
digString = '%i + %i + %i = %i' % ( L[i], L[j], L[k], T)
if digString in seen:
continue
else:
print(digString)
seen.update({digString : True})
# output:
#
# Using default input L: [-25, -10, -7, -3, 2, 4, 8, 10]
# -10 + 2 + 8 = 0
# -7 + -3 + 10 = 0
|
