Perl 5 数一数字符串中每个字母出现的次数(二)

Perl 5正则表达式前三个是 m//, s///, tr/// ,m即match, 即是找匹配。

• 只是查找 - m查找，g全部字符串，数字母 a - z 个数。

#!/usr/bin/perl -w
my $array = "sadfdfssdfA35680233sdfasdkjflasd&^^%^&*s;aldjfjxydsjlaskjfsfsdfkfsj";
my @array = split(//,$array);
my $n; my $foundno; my $regex;
for ($n=97;$n<=122;$n++) {
  $regex = chr($n);
  $foundno = 0;
  $foundno++ while ($array =~ m/$regex/g);
  print "Character of \$regex $regex: ",$foundno,"\n";
}

• 查找并替换 - s查找，g全部字符串，数字母 a - z 个数。

#!/usr/bin/perl -w
my $array = "sadfdfssdfA35680233sdfasdkjflasd&^^%^&*s;aldjfjxydsjlaskjfsfsdfkfsj";
my @array = split(//,$array);
my $n; my $foundno; my $regex;
for ($n=97;$n<=122;$n++) {
  $regex = chr($n);
  $foundno = 0;
  $foundno++ while ($array =~ s/$regex/$regex/g);
  print "Character of \$regex $regex: ",$foundno,"\n";

正则式外还可用 index 查找字母 a 的个数

#!/usr/bin/perl -w
$array = "sadfdfssdfABCDE023*s;aldjfjxyxyxyzzzdlgrvmnfsdkafladsjlaskjfsfsdfkfsj";
my $p = -1; $foundno = 0;
my $ch="a";
$p=index($array,$ch,$p+1);
while ($p >= 0) {
    $foundno++;
    $p=index($array,$ch,$p+1);
}
print $foundno;

BTW --- tr/// 是串-串替换用的

#!/usr/bin/perl -w
$array = "sa&^^%^&*s;aldjfjxyxyxyzzzdlgkyiotoupotrvmnfsdkafladsjlaskjfsfsdfkfsj";
$array =~ tr/a-z/A-Z/;
print $array,"\n";

上述操作完成后字符串中的小写字母变成了大写字母。

webform将前后端越来越分离，脚本在后端确实威力巨大。
纯硬件操作，无显示和文本显示可以的；简单控制应用，winform就挺不错了；网络化应用webform还是不错的选择。梳理，发现并补缺，满意的新方向。努力，学习！