两个杨辉三角的perl实现

这个是cu上一位高人写的:

#!/bin/env perl
use 5.010;
my @p = [1];
for ( 1 .. $ARGV[0] || 9 ) 
{
    @_  = @{ $p[-1] };
    @_  = ( 0, @_, @_, 0 );
    $p[$_] = [ map { $_[$_] + $_[@_/2+$_] } 0 .. $#_/2 ];
};
say "@$_" for (@p);

 

这是本人东施效颦邯郸学步的版本:

#!/bin/env perl
use 5.010;
my @p = (0, 1, 0);
say "1";
for (1.. $ARGV[0]||9) 
{
    @_ = map {$p[$_]+$p[$_+1];} 0..$#p-1;
    say "@_";
    @p = (0, @_, 0);
};