我写了一段,但只能对key进行排序
String[] arraySources = {"1","2","3","0"};
int[] arrayValue = {1,424,32,123};
Map mapCurrentWebSite = new TreeMap( new Comparator(){
public int compare(Object o1, Object o2) {
int map1 = Integer.parseInt(((String)o1));
int map2 = Integer.parseInt(((String)o2));
return map1-map2;
}
});
for(int i=0;i<arraySources.length;i++){
mapCurrentWebSite.put(arraySources[i],new Integer(arrayValue[i]));
}
Collection col = mapCurrentWebSite.values();
Vector v1 = new Vector(col);
for(int i=0;i<v1.size();i++){
System.out.println((Integer)v1.get(i));
}
String[] arraySources = {"1","2","3","0"};
int[] arrayValue = {1,424,32,123};
Map mapCurrentWebSite = new TreeMap( new Comparator(){
public int compare(Object o1, Object o2) {
int map1 = Integer.parseInt(((String)o1));
int map2 = Integer.parseInt(((String)o2));
return map1-map2;
}
});
for(int i=0;i<arraySources.length;i++){
mapCurrentWebSite.put(arraySources[i],new Integer(arrayValue[i]));
}
Collection col = mapCurrentWebSite.values();
Vector v1 = new Vector(col);
for(int i=0;i<v1.size();i++){
System.out.println((Integer)v1.get(i));
}
TreeMap就是要对key进行排序啊
构造一个新的空映射,该映射根据给定的比较器进行排序.比较的 都是key的值,红黑树都这样的。 要想比较value的值,另想办法