From 045da04e63323acdfffc3d1a0cd92bf0853364b0 Mon Sep 17 00:00:00 2001 From: Simon Green Date: Sun, 14 Sep 2025 22:54:18 +1000 Subject: sgreen solutions to challenge 338 --- challenge-338/sgreen/python/ch-2.py | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100755 challenge-338/sgreen/python/ch-2.py (limited to 'challenge-338/sgreen/python/ch-2.py') diff --git a/challenge-338/sgreen/python/ch-2.py b/challenge-338/sgreen/python/ch-2.py new file mode 100755 index 0000000000..10dfb99729 --- /dev/null +++ b/challenge-338/sgreen/python/ch-2.py @@ -0,0 +1,29 @@ +#!/usr/bin/env python3 + +import re +import sys + + +def max_distance(arr1: list[int], arr2: list[int]) -> int: + """Return the highest distance between any two integers in the lists. + + Args: + arr1: A list of integers. + arr2: A list of integers. + + Returns: + The highest distance between any two integers in the lists. + """ + return max(abs(a - b) for a in arr1 for b in arr2) + + +def main(): + # Convert input into integers. + arr1 = [int(n) for n in re.split(r'\D+', sys.argv[1])] + arr2 = [int(n) for n in re.split(r'\D+', sys.argv[2])] + result = max_distance(arr1, arr2) + print(result) + + +if __name__ == '__main__': + main() -- cgit