下面是您开始使用一种方法可以基于保持的初始阵列中的每个整数多少次已经出现在地图中的计数的想法。一旦所有的数字都被计算在内,通过递增值的顺序排序的地图,然后打印地图的输出:
import java.util.ArrayList;
import java.util.HashMap;
import java.util.TreeMap;
public class SortCount {
public static void main(String[] args) {
int nums[] = {0,0,0,1,3,3,2,1,3,5,6,0};
HashMap<Integer,Integer> counts = new HashMap<Integer,Integer>();
for(int i = 0; i < nums.length; i++) {
if(counts.containsKey(nums[
Integer c = counts.get(nums[i]) + 1;
counts.put(nums[i], c);
}
else {
counts.put(nums[i],1);
}
}
ValueComparator<Integer,Integer> bvc = new ValueComparator<Integer,Integer>(counts);
TreeMap<Integer,Integer> sortedMap = new TreeMap<Integer,Integer>(bvc);
sortedMap.putAll(counts);
ArrayList<Integer> output = new ArrayList<Integer>();
for(Integer i : sortedMap.keySet()) {
for(int c = 0; c < sortedMap.get(i); c++) {
output.add(i);
}
}
System.out.println(output.toString());
}
}
它采用了Comparator
类的Map
的值进行比较:
import java.util.Comparator;
import java.util.Map;
public class ValueComparator<T1,T2 extends Comparable<T2>> implements Comparator<T1> {
Map<T1,T2> base;
public ValueComparator(Map<T1,T2> base) {
this.base = base;
}
@Override
public int compare(T1 k1, T1 k2) {
T2 val1 = base.get(k1);
T2 val2 = base.get(k2);
return val1.compareTo(val2);
}
}
来源
2012-08-07 10:29:14
Edd
你想要什么结果呢? '{0,0,0,0,1,1,2,3,3,3,5,6}'? – 2012-08-07 09:30:20
要建立在以前的评论:你想排序阵列? – Baz 2012-08-07 09:32:06
“基于计数”是什么意思?如果奇数长度上升,如果长度或类似的东西下降? – billdoor 2012-08-07 09:36:36