查找一位正型数组中出现次数最多的前三个数

package owen.json; import java.sql.Array; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import android.app.Activity; import android.os.Bundle; import android.util.Log; public class SortDemoActivity extends Activity { private boolean exist; private ArrayList<CountObject> co=new ArrayList<CountObject>(); private int [] sort={ 1,2,3,4,54,5,4,3,2,1,1,2,2,2,2,3,3,3,4,4,5,5,5,6,6,7,7,8,2,3,4,5,7,1,4,6,2,5,3,2 }; @Override public void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.main); init(); //利用Collections进行排序 Collections.sort(co, new arraySort()); //输出前三个出现次数最多的三个数以及次数 for(int i=0;i<3;i++){ Log.e("shuzu",co.get(i).toString()); } } public void init(){ for(int i =0;i<sort.length;i++){ if(null!=co){ //遍历对象数组查看是否对象数组已包含当前元素 for(int j=0;j<co.size();j++){ if(sort[i]==co.get(j).getIntNum()){ co.get(j).setCount(co.get(j).getCount()+1); exist=true; break; }else{ exist=false; } } if(!exist){ co.add(new CountObject(this, sort[i], 1)); } // co.add(new CountObject(this, sort[i], 1)); }else{ co.add(new CountObject(this, sort[i], 1)); } } } class arraySort implements Comparator<CountObject>{ public int compare(CountObject arg0, CountObject arg1) { //降序排序 return arg1.getCount()-arg0.getCount(); //升序 // return arg0.getCount()-arg1.getCount(); } } }