数组 arr

★★★ 本篇为原创，需要引用转载的朋友请注明：《 http://blog.csdn.net/YH555/archive/2011/03/07/6230044.aspx》 谢谢支持！ ★★★

 public final static String getArrBig(int[] arr){  String result = "" ;  Set set = new HashSet();  Map<Integer,Integer> map = new HashMap<Integer,Integer>();  for (int i = 0; i < arr.length; i++) {   if(set.contains(arr[i])){     map.put(arr[i], (Integer.valueOf(map.get(arr[i]).toString()) + 1));   }else{    map.put(arr[i], 1);    set.add(arr[i]);   }  }  int bignumber = 0,bigcount=0;  Iterator<Integer> b = map.keySet().iterator();  while (b.hasNext()) {      Integer key = b.next();      Integer value = map.get(key);      if(value > bigcount){       bignumber = key;       bigcount = value;      }else if(value == bigcount && key > bignumber){       bignumber = key;       bigcount = value;      }               System.out.println("key===" + key);//获取键         System.out.println("value===" + value);//获取值    }  return result = bignumber + ""; }