博客
关于我
Perl基础学习02之数组和哈希
阅读量:391 次
发布时间:2019-03-05

本文共 1526 字,大约阅读时间需要 5 分钟。

???Arrays?

??????????????????????????????????????????????

????

my @array1 = (1, "apple", $out); # 1 ????"apple" ?????$out ?????

??????

my $array1_join = join("\t", @array1); # ???????????????

????????

my $len_array1 = $#array1 + 1; # ?????1????

????????

my $len_array2 = scalar @array1; # ????????

????????

foreach (@array1) { print "$_\n"; }

????????

foreach (0..$#array1) { print "$array1[$_] \n"; }

?????????push

my $array_push = "coco"; push(@array1, $array_push); # ???????

?????????pop

my $pop_v = pop @array1; # ?????????print "$pop_v\n"; print "@array1\n";

?????????unshift

my $array_unshift = "rose"; unshift(@array1, $array_unshift); # ???????

?????????shift

my $shift_v = shift @array1; # ?????????print "$shift_v\n"; print "@array1\n";

?????????reverse

my @array2 = reverse @array1; # ???????????print "@array1\n"; print "@array2\n";

???????sort ???????

my @array3 = sort @array1; # ???ASCII ????my @array4 = sort { $b cmp $a } @array1; # ???????

???????

my @array6 = sort { length($b) <=> length($a) } (1, 5, 11, 14);

??????????

???Hash?

???Hash??????????????????????????

????

my %hash1 = ("chr13" => "T13", "chr18" => "T18", "chr21" => "T21");

??????

print "$hash1{'chr13'}\n";

????????

$hash1{'chr13'} = "chr13+"; print "$hash1{'chr13'}\n";$hash1{'chr16'} = "T16"; print "$hash1{'chr16'}\n";

?????????

my @k = keys %hash1; my @v = values %hash1; print "@k\n"; print "@v\n";

???????

my ($k1, $v1); while (($k1, $v1) = each %hash1) { print "$k1 => $v1\n"; }

???????????

print "Exists\n" if exists $hash1{'chr13'};

转载地址:http://dbmwz.baihongyu.com/

你可能感兴趣的文章
poj 3264(简单线段树)
查看>>
Qt笔记——布局管理三件套分割窗口、停靠窗口和堆栈窗口
查看>>
poj 3277 线段树
查看>>
POJ 3349 Snowflake Snow Snowflakes
查看>>
POJ 3411 DFS
查看>>
poj 3422 Kaka's Matrix Travels (费用流 + 拆点)
查看>>
Qt笔记——官方文档全局定义(二)Functions函数
查看>>
POJ 3468 A Simple Problem with Integers
查看>>
poj 3468 A Simple Problem with Integers 降维线段树
查看>>
poj 3468 A Simple Problem with Integers(线段树 插线问线)
查看>>
poj 3485 区间选点
查看>>
poj 3518 Prime Gap
查看>>
poj 3539 Elevator——同余类bfs
查看>>
Qt笔记——官方文档全局定义(三)Macros宏
查看>>
poj 3628 Bookshelf 2
查看>>
Qt笔记——官方文档全局定义(一)Types数据类型
查看>>
POJ 3670 DP LIS?
查看>>
POJ 3683 Priest John's Busiest Day (算竞进阶习题)
查看>>
POJ 3988 Selecting courses
查看>>
POJ 4020 NEERC John's inversion 贪心+归并求逆序对
查看>>