数组实现
/**
* @(#)TongJi.java
*
* TongJi application
*
* @author kuroro
* @version 1.00 2011/9/6
*/
import java.util.Arrays;
public class TongJi {
public static void main(String[] args) {
int[] a = new int[41];
for(int i=0;i<50;i++)
{
int count = (int)(Math.random()*41)+10;
System.out.print(count+" ");
a[count-10]++;
}
for(int j = 0 ; j< a.length; j++)
{
if(a[j]==0)
continue;
else
{
System.out.println();
System.out.println((j+10)+"出现了"+a[j]+"次");
}
}
int max=a[0];
for(int j=0;j<a.length;j++)
{
if(a[j]>max)
ma