java 自定义排序
public static void main(String[] args) {
Integer []arr = {1,2,3,6,5,4,9,8,7};
pop(arr, new Comparator() {
@Override
public int compare(Object o, Object t1) {
Integer i1= (Integer) o;
Integer i2 = (Integer) t1;
return i2 - i1;
}
});
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]);
}
}
public static void pop(Integer[] arr, Comparator c){
int temp = 0;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if (c.compare(arr[j], arr[j + 1]) > 0) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}