aboutsummaryrefslogtreecommitdiff
path: root/challenge-327
diff options
context:
space:
mode:
authorWalt Mankowski <waltman@pobox.com>2025-06-27 11:47:51 -0400
committerWalt Mankowski <waltman@pobox.com>2025-06-27 11:47:51 -0400
commit7f778a927b467bdfd26b495ce1907d608bd88fa3 (patch)
treeccd1e51b922dfdff737df45c9deb9661940218cd /challenge-327
parent31d22f3b58345541ef1d8ce7fcb6e9392c6ec782 (diff)
downloadperlweeklychallenge-club-7f778a927b467bdfd26b495ce1907d608bd88fa3.tar.gz
perlweeklychallenge-club-7f778a927b467bdfd26b495ce1907d608bd88fa3.tar.bz2
perlweeklychallenge-club-7f778a927b467bdfd26b495ce1907d608bd88fa3.zip
replaced nested loops with itertools.combinations
Diffstat (limited to 'challenge-327')
-rw-r--r--challenge-327/walt-mankowski/python/ch-2.py16
1 files changed, 8 insertions, 8 deletions
diff --git a/challenge-327/walt-mankowski/python/ch-2.py b/challenge-327/walt-mankowski/python/ch-2.py
index f45867b112..2a95a9263c 100644
--- a/challenge-327/walt-mankowski/python/ch-2.py
+++ b/challenge-327/walt-mankowski/python/ch-2.py
@@ -1,17 +1,17 @@
from sys import argv
+from itertools import combinations
min_dist = 1e300
pairs = []
elements = sorted(map(int, argv[1:]))
-for i in range(0, len(elements) - 1):
- for j in range(i+1, len(elements)):
- delta = abs(elements[i] - elements[j])
- if delta < min_dist:
- pairs = [[elements[i], elements[j]]]
- min_dist = delta
- elif delta == min_dist:
- pairs.append([elements[i], elements[j]])
+for i,j in combinations(range(len(elements)), 2):
+ delta = abs(elements[i] - elements[j])
+ if delta < min_dist:
+ pairs = [[elements[i], elements[j]]]
+ min_dist = delta
+ elif delta == min_dist:
+ pairs.append([elements[i], elements[j]])
print(pairs)