aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorNiels van Dijke <perlboy@cpan.org>2020-08-13 10:35:00 +0000
committerNiels van Dijke <perlboy@cpan.org>2020-08-13 10:35:00 +0000
commitce03143ce07f1619f05221a4e3760a28cf19a917 (patch)
treeee8d8ec4f52c4afa681f44055ce99a3c9d2632d7
parent0940ee57dbd2d4a9918a74e52e3cc1266eb5196f (diff)
downloadperlweeklychallenge-club-ce03143ce07f1619f05221a4e3760a28cf19a917.tar.gz
perlweeklychallenge-club-ce03143ce07f1619f05221a4e3760a28cf19a917.tar.bz2
perlweeklychallenge-club-ce03143ce07f1619f05221a4e3760a28cf19a917.zip
Task 1 & 2
-rwxr-xr-xchallenge-073/perlboy1967/perl/ch-1.pl35
-rwxr-xr-xchallenge-073/perlboy1967/perl/ch-2.pl32
2 files changed, 67 insertions, 0 deletions
diff --git a/challenge-073/perlboy1967/perl/ch-1.pl b/challenge-073/perlboy1967/perl/ch-1.pl
new file mode 100755
index 0000000000..abe3d9e81e
--- /dev/null
+++ b/challenge-073/perlboy1967/perl/ch-1.pl
@@ -0,0 +1,35 @@
+#!/usr/bin/perl
+
+# Perl Weekly Challenge - 073
+# - https://perlweeklychallenge.org/blog/perl-weekly-challenge-073/
+#
+# Task 1 - Min Sliding Window
+#
+# Author: Niels 'PerlBoy' van Dijke
+
+use strict;
+use warnings;
+
+use List::Util qw(min);
+
+my ($S) = @ARGV;
+
+die "S must be a positive integer"
+ unless (defined $S and $S =~ m#^[1-9][0-9]*$#);
+
+my @S;
+
+# Create list with random integer values
+my @A = map {int(rand(100))} (1 .. $S * 3);
+
+printf "Input:\n\t\@A = (%s)\n\t\$S = %d\n\n", join(', ', @A), $S;
+
+for (my $i = 0; $i < scalar(@A) - $S + 1; $i++) {
+ my @s = @A[$i .. $i + $S - 1];
+
+ push(@S, min(@s));
+
+ printf "min(%s) = %d\n", join(', ',@s), $S[-1];
+}
+
+printf "\nOutput:\n\t\@S = (%s)\n", join(', ', @S);
diff --git a/challenge-073/perlboy1967/perl/ch-2.pl b/challenge-073/perlboy1967/perl/ch-2.pl
new file mode 100755
index 0000000000..55ecb89b0f
--- /dev/null
+++ b/challenge-073/perlboy1967/perl/ch-2.pl
@@ -0,0 +1,32 @@
+#!/usr/bin/perl
+
+# Perl Weekly Challenge - 073
+# - https://perlweeklychallenge.org/blog/perl-weekly-challenge-073/
+#
+# Task 2 - Smallest Neighbour
+#
+# Author: Niels 'PerlBoy' van Dijke
+
+use strict;
+use warnings;
+
+use List::Util qw(min);
+
+my @N = (0);
+
+# Create list with random integer values
+my @A = map {int(rand(100))} (1 .. 10);
+
+printf "Input:\n\t\@A = (%s)\n\n", join(', ', @A);
+
+for (my $i = 1; $i < scalar(@A); $i++) {
+ my @s = @A[0 .. $i-1];
+ my $min = min(@s);
+
+ push(@N, $min < $A[$i] ? $min : 0);
+
+ printf "%d\tmin(%s) = %d, %d < %d ? %d : 0 => %d\n",
+ $A[$i], join(', ',@s), $min, $A[$i], $min, $min, $N[-1];
+}
+
+printf "\nOutput:\n\t\@S = (%s)\n", join(', ', @N);