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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
#!/usr/bin/perl
# Perl Weekly Challenge - 088
# - https://perlweeklychallenge.org/blog/perl-weekly-challenge-088/
#
# Task 2 - Spiral Matrix
#
# Author: Niels 'PerlBoy' van Dijke
use strict;
use warnings;
use Data::Printer;
sub matrix($);
# Unbuffered STDOUT
$|++;
my $ar = [
[qw(1 2)],
[qw(3 4)],
];
my $ar1 = [
[qw(1 2 3)],
[qw(4 5 6)],
[qw(7 8 9)],
];
my $ar2 = [
[qw( 1 2 3 4)],
[qw( 5 6 7 8)],
[qw( 9 10 11 12)],
[qw(13 14 15 16)],
];
my $hrM = matrix($ar2);
my @O;
my @dirVector = (
[ 0, 1],
[ 1, 0],
[ 0,-1],
[-1, 0]
);
my ($r, $c) = (0, 0);
LOOP:
while (1) {
push(@O, delete($hrM->{$r}{$c}));
my $rot = 0;
while (!exists($hrM->{$r+$dirVector[0][0]}{$c+$dirVector[0][1]})) {
push(@dirVector, shift(@dirVector));
$rot++;
last LOOP if ($rot > 1);
}
$r += $dirVector[0][0];
$c += $dirVector[0][1];
}
p @O;
sub matrix($) {
my ($ar) = @_;
my $m;
my $r = 0;
foreach my $row (@$ar) {
my $c = 0;
map { $m->{$r}{$c++} = $_ } @$row;
$r++;
}
return $m;
}
|
