aboutsummaryrefslogtreecommitdiff
path: root/challenge-268/dave-jacoby/perl/ch-1.pl
blob: 44ecb815d15396c64b60052500bfab7bbd1b6b3f (plain)
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
#!/usr/bin/env perl

use strict;
use warnings;
use experimental qw{ fc postderef say signatures state };

use List::Util qw{ uniq any };

my @examples = (

    [ [ 3, 7, 5 ], [ 9, 5, 7 ], ],
    [ [ 1, 2, 1 ], [ 5, 4, 4 ], ],
    [ [2], [5], ],
);

for my $example (@examples) {
    my $output = find_magic_number(@$example);
    my $x      = join ',', $example->[0]->@*;
    my $y      = join ',', $example->[1]->@*;
    say <<"END";
    Input:  \@x = ($x)
            \@y = ($y)
    Output: $output
END
}

sub find_magic_number (@arrays) {
    my ( $x, $y ) = @arrays;
    my %hash;
    my %o;
    my @n;
    for my $v ( $x->@* ) {
        my @o = map { abs $v - $_ } $y->@*;
        $hash{$v}->@* = @o;
        push @n, @o;
    }
    for my $v ( uniq sort @n ) {
        my $c = 0;
        for my $k ( keys %hash ) {
            $c++ if any { $v == $_ } $hash{$k}->@*;
        }
        $o{$v} = $c;
    }
    my @o = sort { $o{$b} <=> $o{$a} } keys %o;
    return shift @o;
}