基于1,1.1,1.1.1,1.2,1.2.1,2,2.1的排序
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Random;
/**
* <h1>.</h1><BR/>
*
* @author cyj - 2014-10-26
*/
public class MapComparator implements Comparator<Map<String, Object>> {
/**
* 排序用到的key
*/
private String key;
public MapComparator(String key) {
this.key = key;
}
@Override
public int compare(Map<String, Object> o1, Map<String, Object> o2) {
// 获取比较的字符串
String compareValue1 = (String) o1.get(key);
String compareValue2 = (String) o2.get(key);
String[] valueSplit1 = compareValue1.split("[.]");
String[] valueSplit2 = compareValue2.split("[.]");
int minLength = valueSplit1.length;
if (minLength > valueSplit2.length) {
minLength = valueSplit2.length;
}
for (int i = 0; i < minLength; i++) {
int value1 = Integer.parseInt(valueSplit1[i]);
int value2 = Integer.parseInt(valueSplit2[i]);
if(value1 > value2){
return 1;
}else if(value1 < value2){
return -1;
}
}
return valueSplit1.length - valueSplit2.length;
}
public static void main(String[] args) {
List<Map<String,Object>> list = new ArrayList<Map<String,Object>>();
Random random = new Random();
for(int i = 0;i<10;i++){
Map<String,Object> map = new HashMap<String, Object>();
int lenght = random.nextInt(5) + 2;
String compareKey = null;
for(int j = 0 ;j<lenght;j++){
if(compareKey == null){
compareKey = "" + random.nextInt(3);
}else{
compareKey += "." + random.nextInt(3);
}
}
map.put("compareKey", compareKey);
list.add(map);
}
System.out.println("排序之前");
printMap(list);
Collections.sort(list, new MapComparator("compareKey"));
System.out.println("\n排序之后");
printMap(list);
}
public static void printMap(List<Map<String,Object>> list){
for(int i=0;i<list.size();i++){
System.out.println(list.get(i).get("compareKey") );
}
}
}
程序运行结果:
排序之前
2.1.0
1.0.0.1.1
1.0.2
0.1.1
0.0.2
1.2.0
1.1.1.2.0.2
2.2.2.2.2.1
1.2
2.1.2
排序之后
0.0.2
0.1.1
1.0.0.1.1
1.0.2
1.1.1.2.0.2
1.2
1.2.0
2.1.0
2.1.2
2.2.2.2.2.1