同事發(fā)了一道shell題,是求一個多維數(shù)組中的最大和最小值
如文件 99file:
33 55 23 56 99
234 234 545 6546 34
11 43 534 33 75
43 34 76 756 33
343 890 77 667 55
我的實現(xiàn)之一:
#! /bin/bash echo "the file is :" cat 99shu max=0 min=999999 line=1 dnum=$(cat 99shu| wc -l) while (($line=$dnum)) do for i in $(cat 99shu|head -"$line") do ((max$i))max=$i ((min>$i))min=$i done let ++line done echo "the max number is: $max" echo "the min number is : $min"
結果:
the max number is: 6546
the min number is : 11
實現(xiàn)之二:
#! /bin/bash # echo the MAX and the MIN echo "the numbers is:" cat 99shu mnum=0 min=99999 while read line do declare -a arr=($line) lnum=$(echo $line | wc -w) i=0 while (( $i$lnum )) do (($mnum${arr[i]})) mnum=${arr[i]} (($min>${arr[i]})) min=${arr[i]} let ++i done done 99shu echo "the max number is $mnum" echo "the min number is $min"
實現(xiàn)3,強大的awk
#! /bin/bash echo "the MAX number is: $( cat 99shu | awk '{for(i=1;i=NF;i++)if(max$i) max=$i;print max}'|tail -1)" echo "eht MIN number is: $( cat 99shu | awk '{min=999999;for(i=1;i=NF;i++)if(min>$i)min=$i;print min}'|sort|head -1 )"
實現(xiàn)4:
#!/bin/bash min=$(cat 99shu | tr "\t" "\n"|tr " " "\n"|sort -n|uniq|grep -v "^$"|head -1) max=$(cat 99shu | tr "\t" "\n"|tr " " "\n"|sort -n|uniq|grep -v "^$"|tail -1) echo "The MAX number is $max" echo "The MIN number is $min"
標簽:百色 鎮(zhèn)江 武漢 六盤水 丹東 自貢 優(yōu)質(zhì)小號 滁州
巨人網(wǎng)絡通訊聲明:本文標題《linux shell實現(xiàn)求一個多維數(shù)組中的最大和最小值》,本文關鍵詞 linux,shell,實現(xiàn),求,一個,;如發(fā)現(xiàn)本文內(nèi)容存在版權問題,煩請?zhí)峁┫嚓P信息告之我們,我們將及時溝通與處理。本站內(nèi)容系統(tǒng)采集于網(wǎng)絡,涉及言論、版權與本站無關。