[练习] 分布统计

rubyish

问题:
有一个文件，内容如下：

>a1;30266 K: 25 length: 7764
>a2;21197 K: 25 length: 1303
>a3;19639 K: 25 length: 6523
>a4;21559 K: 25 length: 1051
>a5;9715 K: 25 length: 815
>a6;60114 K: 25 length: 49
>a7;9601 K: 25 length: 1387
>a8;11933 K: 25 length: 1662
>a9;28016 K: 25 length: 96
>a10;5612 K: 25 length: 1879
>a11;12713 K: 25 length: 916
>a12;13947 K: 25 length: 442
>a13;5887 K: 25 length: 2657
>a14;2346 K: 25 length: 9605
>a15;9119 K: 25 length: 405
>a16;2507 K: 25 length: 4692
>a17;18192 K: 25 length: 100
>a18;8527 K: 25 length: 1909
>a19;2477 K: 25 length: 6703
>a20;12117 K: 25 length: 949
>a21;27978 K: 25 length: 49
>a22;10051 K: 25 length: 1189
>a23;6358 K: 25 length: 470
>a24;5987 K: 25 length: 3481
>a25;15254 K: 25 length: 94
>a26;2738 K: 25 length: 1960
>a27;6649 K: 25 length: 603
>a28;11581 K: 25 length: 543
>a29;4613 K: 25 length: 1895
>a30;6662 K: 25 length: 811
>a31;22138 K: 25 length: 35
>a32;8808 K: 25 length: 372

length最少有 1。
统计最后一列的分布个数，以10为一单位，
按照 1~10 之间出现的个数，11~20 之间出现的个数...以此类推

最后排序分布从小到到大输出:

分布  个数

example:
10 5
20 2
30 6
50 8
70 12

bianlimit

1. a = {}
   
2. File.open(ARGV[0],'r').each do |x|
   
3.         case x.rstrip[-2,2][0]
   
4.         when /0|\s/
   
5.            a[0] = a[0].to_i + 1
   
6.         when "1"
   
7.            a[1] = a[1].to_i + 1
   
8.         when "2"
   
9.            a[2] = a[2].to_i + 1
   
10.         when "3"
    
11.            a[3] = a[3].to_i + 1
    
12.         when "4"
    
13.            a[4] = a[4].to_i + 1
    
14.         when "5"
    
15.            a[5] = a[5].to_i + 1
    
16.         when "6"
    
17.            a[6] = a[6].to_i + 1
    
18.         when "7"
    
19.            a[7] = a[7].to_i + 1
    
20.         when "8"
    
21.            a[8] = a[8].to_i + 1
    
22.         when "9"
    
23.            a[9] = a[9].to_i + 1
    
24.         end
    
25. end
    
26. 
    
27. 9.times {|x| puts "#{x}0 range #{a[x]} count"}

复制代码

rubyish

1. #!/usr/bin/ruby -w
   
2. 
   
3. hN = DATA.map {|e| e.scan(/\S+/).last.to_i / 10 + 1 }
   
4.         .group_by {|g| 10 * g }
   
5. 
   
6. hN.keys.sort.each do |k|
   
7.   print k, ?\t, hN[k].size, ?\n
   
8. end
   
9. 
   
10. __END__
    
11. >a1;30266 K: 25 length: 5
    
12. >a2;21197 K: 25 length: 6
    
13. >a3;19639 K: 25 length: 11
    
14. >a4;21559 K: 25 length: 15
    
15. >a5;9715 K: 25 length: 22
    
16. >a6;60114 K: 25 length: 44
    
17. >a7;9601 K: 25 length: 33
    
18. >a8;11933 K: 25 length: 22
    
19. >a9;28016 K: 25 length: 96
    

复制代码

1. 10      2
   
2. 20      2
   
3. 30      2
   
4. 40      1
   
5. 50      1
   
6. 100     1
   

复制代码

rubyish

v2:

1. #!/usr/bin/ruby -w
   
2. DATA.map {|e| e.scan(/\S+/).last.to_i / 10 + 1 }
   
3.     .group_by {|g| 10 * g }
   
4.     .sort.each {|k,v| print k, ?\t, v.size, ?\n }
   
5. 
   
6. __END__
   
7. >a1;30266 K: 25 length: 5
   
8. >a2;21197 K: 25 length: 6
   
9. >a3;19639 K: 25 length: 11
   
10. >a4;21559 K: 25 length: 15
    
11. >a5;9715 K: 25 length: 22
    
12. >a6;60114 K: 25 length: 44
    
13. >a7;9601 K: 25 length: 33
    
14. >a8;11933 K: 25 length: 22
    
15. >a9;28016 K: 25 length: 96
    

复制代码