Map按value排序并取前10条

//Map 按value值从大到小排序，并取前10
public static Map<String, Double> sortMapByValue(Map<String, Double> map) { 

Map<String, Double> sortedMap = new LinkedHashMap<String, Double>(); 

List<Entry<String,Double>>lists=new ArrayList<Entry<String,Double>>(map.entrySet());
Collections.sort(lists,new Comparator<Map.Entry<String, Double>>() {
public int compare(Map.Entry<String, Double> o1,Map.Entry<String, Double> o2)
{
double q1=o1.getValue();
double q2=o2.getValue();
double p=q2-q1;
if(p>0){
return 1;
}
else if(p==0){
return 0;
}
else
return -1;
}
});

if(lists.size()>=10){

//lists.subList()用法

for(Map.Entry<String, Double> set:lists.subList(0, 10)){
sortedMap.put(set.getKey(), set.getValue());  
}
}else {
for(Map.Entry<String, Double> set:lists){
sortedMap.put(set.getKey(), set.getValue());  
}
}
  return sortedMap;

}

public static void main(String[] args) {
Map<String,Double> map=new TreeMap<String,Double>();
map.put("mit", 3795104.300);
map.put("ramin", 6.155);
map.put("research", 889.159);
map.put("mit1", 3795105.300);
map.put("ramin1", 7.155);
map.put("research1", 900.159);
map.put("mix1", 2.375);
map.put("gorgeou1", 10.341);
map.put("shneiderman1", 8.775);
System.out.println(sortMapByValue(map));
}

输出结果：

{mit1=3795105.3, mit=3795104.3, research1=900.159, research=889.159, gorgeou1=10.341, gorgeou=9.341, shneiderman1=8.775, shneiderman=7.775, ramin1=7.155, ramin=6.155}