public class NumberCount {

     public static void main(String arg[])

     {

         int a[]= {1,3,4,7,2,1,1,5,2,5,7,2,1,1,3};

         int currNumber,currMaxCount=1,currMinCount=1;

         int max=0,min=0;

         int currCount[]= {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};

         for(int i=0;i<a.length;i++)

         {

             currNumber=a[i];

             for(int j=0;j<a.length;j++)

             {

                 if(a[j]==currNumber)

                     currCount[i]=currCount[i]+1;

             }

         }

         for(int i=0;i<a.length;i++)

         {

             if(currMaxCount<=currCount[i])

                 {

                     currMaxCount=currCount[i];

                     max=a[i];

                 }

         }

         for(int i=0;i<a.length;i++)

         {

             if(currMinCount>=currCount[i])

                 {

                     currMinCount=currCount[i];

                     min=a[i];

                 }

         }

         for(int i=0;i<a.length;i++)

             System.out.println(a[i]+"出现次数:"+currCount[i]);

         System.out.print("出现最多的数字为"+max+" 出现次数最少的数字为："+min);

     }

 }