# Print list
my $head = $list ;
while ($head->[0]) {
print $head->[1], "\n" ;
$head = $head->[0] ;
}
一个更好的方法,模拟C/C++中的方法来创建链表。
# The perl version of linklist
#
# Define a node, since perl does not have anything like 'struct' in C/C++
# So we use function to define and return a node
sub node {
my ($value, $next) = @_ ;
my $self = {
'value' => $value,
'next' => $next,
} ;
return $self ;
}
# Print the linklist, iterate from head to tail and print value for each node
sub print_list {
my $head = shift ;
while ($head) {
print $head->{value}, "\n" ;
$head = $head->{next} ;
}
}
# Create a linklist, create a head first, then insert node one by one
sub create_list {
my $head= &node(1, undef) ;
my $temp = $head ;
for my $i (2..10) {
$temp->{next} = &node($i, undef) ;
$temp = $temp->{next} ;
}
return $head ;
}
sub main {
my $head = &create_list() ;
&print_list($head) ;
}
&main() ;
1 ;
==