Comparator排序的使用
通过重写Comparator的compare方法实现比较大小,又通过Collections的sort()实现排序。
List<String> list = Arrays.asList(new String[] {"3","4","1","9","0","7"});
Collections.sort(list, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
int s = o1.compareTo(o2);
return s;
}
});
for(String s : list) {
System.out.print(s+"\t");
}
输出结果是:0 1 3 4 7 9
List<String> list = Arrays.asList(new String[] {"3","4","1","9","0","7"});
Collections.sort(list, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
int s = -o1.compareTo(o2);
return s;
}
});
for(String s : list) {
System.out.print(s+"\t");
}
输出结果是:9 7 4 3 1 0
compare比较返回正数,零,负数各代表大于,等于,小于。不难理解前面加个“-”号就会倒序排列了。
Collections.sort()方法查看源码,使用的是 Arrays.sort():
@SuppressWarnings({"unchecked", "rawtypes"})
default void sort(Comparator<? super E> c) {
Object[] a = this.toArray();
Arrays.sort(a, (Comparator) c);
ListIterator<E> i = this.listIterator();
for (Object e : a) {
i.next();
i.set((E) e);
}
}
如果继续深究里面源码,会有binarySort,以及简单的交换,有兴趣的可以继续翻读源码,楼主小白就不列举了:
private static void swap(Object[] x, int a, int b) {
Object t = x[a];
x[a] = x[b];
x[b] = t;
}