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
|
#!/usr/bin/perl
# Perl Weekly Challenge - 111
# - https://perlweeklychallenge.org/blog/perl-weekly-challenge-111/#TASK1
#
# Task 1 - Search Matrix
#
# Author: Niels 'PerlBoy' van Dijke
use v5.16;
use strict;
use warnings;
use List::BinarySearch qw(binsearch_pos);
use Data::Printer;
use Test::More;
# Prototype(s)
sub searchMatrix(\@$);
my @m = (
[ 1, 2, 3, 5, 7 ],
[ 9, 11, 15, 19, 20 ],
[ 23, 24, 25, 29, 31 ],
[ 32, 33, 39, 40, 42 ],
[ 45, 47, 48, 49, 50 ],
);
is (searchMatrix(@m,35),0);
is (searchMatrix(@m,39),1);
done_testing;
sub searchMatrix(\@$) {
my ($arM,$i) = @_;
# Flatten matrix to ordered list
my @l = map {@$_} @$arM;
return ($l[binsearch_pos {$a<=>$b} $i, @l] == $i ? 1 : 0);
}
|
