1,整型数组直接排序;
public static void main(String[] args) {
int[] arr2 = {1,2,5,3,2};
Arrays.sort(arr2);
System.out.println(Arrays.toString(arr2));
}
2.字符串分割转整型排序
public static void main(String[] args) {
String s = "12 23 5 3 4 54";
String[] split = s.split(" ");
//定义整型数组
int[] arr = new int[split.length];
for (int i = 0; i < split.length; i++) {
arr[i] = Integer.parseInt(split[i]);
}
Arrays.sort(arr);
System.out.println(Arrays.toString(arr));
}
3.字符串分割转整型排序逆序:
测试方法:
import java.util.Arrays;
import java.util.Comparator;
public class Test {
@SuppressWarnings({ "unchecked", "rawtypes" })
public static void main(String[] args) {
// 注意,要想改变默认的排列顺序,不能使用基本类型(int,double, char)
// 而要使用它们对应的类
Integer[] a = { 19, 28, 7, 2, 3, 4, 1, 0, 6, 5 };
// 定义一个自定义类MyComparator的对象
Comparator cmp = new MyComparator();
Arrays.sort(a, cmp);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}
}
自定义比较类,实现Comparator接口:
import java.util.Comparator;
public class MyComparator implements Comparator<Integer> {
@Override
public int compare(Integer o1, Integer o2) {
// 如果o1小于o2,我们就返回正值,如果n1大于n2我们就返回负值,
return o2-o1;
}
}