查找整型数组里出现频率最高的数字的算法

/* * $RCSfile: Test.java,v $ * $Revision: 1.1 $ * $Date: 2009-2-24 $ * * Copyright (C) 2005 Bettem, Inc. All rights reserved. * * This software is the proprietary information of Bettem, Inc. * Use is subject to license terms. */ package test; import java.util.HashMap; import java.util.Iterator; import java.util.List; import java.util.Map; import java.util.Set; /** * <p> * Title: Test * </p> * <p> * Description: * </p> * <p> * Copyright: Copyright (c) 2006 * </p> * * @author lihan * @version 1.0 */ public class Test { public static void main(String[] args) { int[] ss = { 1,-1,-1,-1,-2,-2,-2, 3, 2, 5, 2, 5, 7 }; Map map = new HashMap(); for (int i = 0; i < ss.length; i++) { int count = 0; for (int j = 0; j < ss.length; j++) { if (ss[i] == (ss[j])) { count = count + 1; } } map.put(ss[i], count); } Set key = map.keySet(); int k = key.size(); int ii[] = new int[k]; k = 0; int temp = 0; int temp2 = 0; for (Iterator iterator = key.iterator(); iterator.hasNext();) { int name = Integer.parseInt(iterator.next().toString()); int count2 = Integer.parseInt(map.get(name).toString()); if (temp < count2) { temp = count2; } System.out.println(name + " " + count2 + " 次"); } for (Iterator iterator = key.iterator(); iterator.hasNext();) { int name = Integer.parseInt(iterator.next().toString()); int count2 = Integer.parseInt(map.get(name).toString()); if (temp == count2) { ii[k] = name; k++; } } System.out.print("次数最多:"); for (int i = 0; i < ii.length; i++) { if (ii[i] != 0) { System.out.print(ii[i] + " "); } } } }