Map排序
package com.tdt.list;import java.util.ArrayList;import java.util.Collections;import java.util.Comparator;import java.util.List;import java.util.Map;import java.util.TreeMap;public class TestMapOrder {public static void main(String[] args) {Map<String, Integer> map = new TreeMap<String, Integer>();map.put("j2se", 20);map.put("j2ee", 10);map.put("j2me", 30);map.put("html", 50);map.put("oracle", 60);List<Map.Entry<String, Integer>> infoIds = new ArrayList<Map.Entry<String, Integer>>(map.entrySet());// 排序前System.out.println("排序前 ");for (int i = 0; i < infoIds.size(); i++) {String id = infoIds.get(i).toString();System.out.println(id);}// 排序Collections.sort(infoIds, new Comparator<Map.Entry<String, Integer>>() {public int compare(Map.Entry<String, Integer> o1,Map.Entry<String, Integer> o2) {//return (o2.getValue() - o1.getValue()); //降序return (o1.getValue() - o2.getValue()); //升序}});// 排序后System.out.println("排序后 ");for (int i = 0; i < infoIds.size(); i++) {String id = infoIds.get(i).toString();System.out.println(id);}}} 输出:排序前
html=50
j2ee=10
j2me=30
j2se=20
oracle=60
排序后
j2ee=10
j2se=20
j2me=30
html=50
oracle=60
页:
[1]