From d2d3f658384be159cedb6d4288524a14cfd1d3ea Mon Sep 17 00:00:00 2001 From: Packy Anderson Date: Fri, 16 May 2025 00:37:33 -0400 Subject: Challenge 321 solutions by Packy Anderson * Raku that maybe looks like Raku, but mostly like Perl * Perl * Python that definitely looks like Perl * Elixir that looks kinda like Elixir 1 blog post --- challenge-321/packy-anderson/python/ch-1.py | 46 +++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100755 challenge-321/packy-anderson/python/ch-1.py (limited to 'challenge-321/packy-anderson/python/ch-1.py') diff --git a/challenge-321/packy-anderson/python/ch-1.py b/challenge-321/packy-anderson/python/ch-1.py new file mode 100755 index 0000000000..a39a0b68ec --- /dev/null +++ b/challenge-321/packy-anderson/python/ch-1.py @@ -0,0 +1,46 @@ +#!/usr/bin/env python + +from collections import Counter + +def distinctAverages(nums): + nums.sort() # list.sort() works in place + explain, step = "", 0 + averages = Counter() + while nums: + min, max = nums.pop(0), nums.pop(-1) + avg = (min + max) / 2 + # since in Python, this will always produce a real number, + # we need to do a little more work to make sure avg is an + # integer when it has no fractional component + if avg == int(avg): + avg = int(avg) + step += 1 + explain += ( + f"Step {step}: Min = {min}, Max = {max}, Avg = {avg}\n" + ) + averages[avg] += 1 + count = len(list(averages)) + explain += ( + f"\nThe count of distinct average is {count}." + ) + return count, explain + +def int_join(joiner, arr): + return joiner.join(map(lambda i: str(i), arr)) + +def solution(nums): + print(f'Input: @nums = ({int_join(", ", nums)})') + count, explain = distinctAverages(nums) + print(f'Output: {count}\n\n{explain}') + +print('Example 1:') +solution([1, 2, 4, 3, 5, 6]) + +print('\nExample 2:') +solution([0, 2, 4, 8, 3, 5]) + +print('\nExample 3:') +solution([7, 3, 1, 0, 5, 9]) + +print('\nExample 4:') +solution([1, 9, 2, 6, 3, 4]) \ No newline at end of file -- cgit