diff options
| -rw-r--r-- | challenge-334/jeanluc2020/blog-1.txt | 1 | ||||
| -rw-r--r-- | challenge-334/jeanluc2020/blog-2.txt | 1 | ||||
| -rwxr-xr-x | challenge-334/jeanluc2020/perl/ch-1.pl | 78 | ||||
| -rwxr-xr-x | challenge-334/jeanluc2020/perl/ch-2.pl | 133 |
4 files changed, 213 insertions, 0 deletions
diff --git a/challenge-334/jeanluc2020/blog-1.txt b/challenge-334/jeanluc2020/blog-1.txt new file mode 100644 index 0000000000..40fd55a0eb --- /dev/null +++ b/challenge-334/jeanluc2020/blog-1.txt @@ -0,0 +1 @@ +http://gott-gehabt.de/800_wer_wir_sind/thomas/Homepage/Computer/perl/theweeklychallenge-334-1.html diff --git a/challenge-334/jeanluc2020/blog-2.txt b/challenge-334/jeanluc2020/blog-2.txt new file mode 100644 index 0000000000..47e7cf9ea1 --- /dev/null +++ b/challenge-334/jeanluc2020/blog-2.txt @@ -0,0 +1 @@ +http://gott-gehabt.de/800_wer_wir_sind/thomas/Homepage/Computer/perl/theweeklychallenge-334-2.html diff --git a/challenge-334/jeanluc2020/perl/ch-1.pl b/challenge-334/jeanluc2020/perl/ch-1.pl new file mode 100755 index 0000000000..8aa1e04ce3 --- /dev/null +++ b/challenge-334/jeanluc2020/perl/ch-1.pl @@ -0,0 +1,78 @@ +#!/usr/bin/env perl +# https://theweeklychallenge.org/blog/perl-weekly-challenge-334/#TASK1 +# +# Task 1: Range Sum +# ================= +# +# You are given a list integers and pair of indices.. +# +# Write a script to return the sum of integers between the given indices (inclusive). +# +## Example 1 +## +## Input: @ints = (-2, 0, 3, -5, 2, -1), $x = 0, $y = 2 +## Output: 1 +## +## Elements between indices (0, 2) => (-2, 0, 3) +## Range Sum: (-2) + 0 + 3 => 1 +# +# +## Example 2 +## +## Input: @ints = (1, -2, 3, -4, 5), $x = 1, $y = 3 +## Output: -3 +## +## Elements between indices (1, 3) => (-2, 3, -4) +## Range Sum: (-2) + 3 + (-4) => -3 +# +# +## Example 3 +## +## Input: @ints = (1, 0, 2, -1, 3), $x = 3, $y = 4 +## Output: 2 +## +## Elements between indices (3, 4) => (-1, 3) +## Range Sum: (-1) + 3 => 2 +# +# +## Example 4 +## +## Input: @ints = (-5, 4, -3, 2, -1, 0), $x = 0, $y = 3 +## Output: -2 +## +## Elements between indices (0, 3) => (-5, 4, -3, 2) +## Range Sum: (-5) + 4 + (-3) + 2 => -2 +# +# +## Example 5 +## +## Input: @ints = (-1, 0, 2, -3, -2, 1), $x = 0, $y = 2 +## Output: 1 +## +## Elements between indices (0, 2) => (-1, 0, 2) +## Range Sum: (-1) + 0 + 2 => 1 +# +############################################################ +## +## discussion +## +############################################################ +# +# We just need to calculate the sum of a slice of the input array. +# We use sum() from List::Util which makes the whole operation really +# easy and quick. + +use v5.36; + +use List::Util qw( sum ); + +range_sum( [-2, 0, 3, -5, 2, -1], 0, 2); +range_sum( [1, -2, 3, -4, 5], 1, 3); +range_sum( [1, 0, 2, -1, 3], 3, 4); +range_sum( [-5, 4, -3, 2, -1, 0], 0, 3); +range_sum( [-1, 0, 2, -3, -2, 1], 0, 2); + +sub range_sum($ints, $x, $y) { + say "Input: (" . join(", ", @$ints) . "), $x, $y"; + say "Output: " . sum( @$ints[$x..$y] ); +} diff --git a/challenge-334/jeanluc2020/perl/ch-2.pl b/challenge-334/jeanluc2020/perl/ch-2.pl new file mode 100755 index 0000000000..b6fc88c819 --- /dev/null +++ b/challenge-334/jeanluc2020/perl/ch-2.pl @@ -0,0 +1,133 @@ +#!/usr/bin/env perl +# https://theweeklychallenge.org/blog/perl-weekly-challenge-334/#TASK2 +# +# Task 2: Nearest Valid Point +# =========================== +# +# You are given current location as two integers: x and y. You are also given a +# list of points on the grid. +# +# A point is considered valid if it shares either the same x-coordinate or the +# same y-coordinate as the current location. +# +# Write a script to return the index of the valid point that has the smallest +# Manhattan distance to the current location. If multiple valid points are tied +# for the smallest distance, return the one with the lowest index. If no valid +# points exist, return -1. +# +#### The Manhattan distance between two points (x1, y1) and (x2, y2) is +#### calculated as: |x1 - x2| + |y1 - y2| +# +# +## Example 1 +## +## Input: $x = 3, $y = 4, @points ([1, 2], [3, 1], [2, 4], [2, 3]) +## Output: 2 +## +## Valid points: [3, 1] (same x), [2, 4] (same y) +## +## Manhattan distances: +## [3, 1] => |3-3| + |4-1| = 3 +## [2, 4] => |3-2| + |4-4| = 1 +## +## Closest valid point is [2, 4] at index 2. +# +# +## Example 2 +## +## Input: $x = 2, $y = 5, @points ([3, 4], [2, 3], [1, 5], [2, 5]) +## Output: 3 +## +## Valid points: [2, 3], [1, 5], [2, 5] +## +## Manhattan distances: +## [2, 3] => 2 +## [1, 5] => 1 +## [2, 5] => 0 +## +## Closest valid point is [2, 5] at index 3. +# +# +## Example 3 +## +## Input: $x = 1, $y = 1, @points ([2, 2], [3, 3], [4, 4]) +## Output: -1 +## +## No point shares x or y with (1, 1). +# +# +## Example 4 +## +## Input: $x = 0, $y = 0, @points ([0, 1], [1, 0], [0, 2], [2, 0]) +## Output: 0 +## +## Valid points: all of them +## +## Manhattan distances: +## [0, 1] => 1 +## [1, 0] => 1 +## [0, 2] => 2 +## [2, 0] => 2 +## +## Tie between index 0 and 1, pick the smaller index: 0 +# +# +## Example 5 +## +## Input: $x = 5, $y = 5, @points ([5, 6], [6, 5], [5, 4], [4, 5]) +## Output: 0 +## +## Valid points: all of them +## [5, 6] => 1 +## [6, 5] => 1 +## [5, 4] => 1 +## [4, 5] => 1 +## +## All tie, return the one with the lowest index: 0 +# +############################################################ +## +## discussion +## +############################################################ +# +# We just walk the array of points from the first element to the +# last, calculating the Manhattan distance for all valid points. +# If we have a new lowest distance, we keep track of both the +# distance and the index. By initializing both values to -1, we +# have a perfect way to make sure we can keep track of whether we +# found any valid points so far and return -1 if we don't find any. + +use v5.36; + +nearest_valid_point( 3, 4, ([1, 2], [3, 1], [2, 4], [2, 3]) ); +nearest_valid_point( 2, 5, ([3, 4], [2, 3], [1, 5], [2, 5]) ); +nearest_valid_point( 1, 1, ([2, 2], [3, 3], [4, 4]) ); +nearest_valid_point( 0, 0, ([0, 1], [1, 0], [0, 2], [2, 0]) ); +nearest_valid_point( 5, 5, ([5, 6], [6, 5], [5, 4], [4, 5]) ); + +sub nearest_valid_point( $x, $y, @points ) { + say "Input: $x, $y, (" . join(", ", map { "[$_->[0], $_->[1]]" } @points) . ")"; + my $index = -1; + my $dist = -1; + foreach my $i (0..$#points) { + my $tmp_dist; + if($x == $points[$i]->[0]) { + my $d = abs($y - $points[$i]->[1]); + if($dist == -1 || $dist > $d) { + $dist = $d; + $index = $i; + } + } elsif ($y == $points[$i]->[1]) { + my $d = abs($x - $points[$i]->[0]); + if($dist == -1 || $dist > $d) { + $dist = $d; + $index = $i; + } + } else { + # neither $x nor $y match the point we're looking at, skip it + } + } + say "Output: $index"; +} + |