Java的对象排序
在Java中如果想像C语言中的结构体排序,有两种方式,第一种是实现Comparable接口,第二种是使用Comparator定制排序,现在我们要对一个学生对象进行定制排序(先按照学号由小到大进行排序,若学号大小相同则按照名字的字典序进行排序)。
排序我们使用的是Collections中的sort方法,看源码可知sort支持这两种排序:
- 由下图可知,待排序类继承Comparable接口后可使用sort方法。
也可以直接传入Comparator。
Comparable接口
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class Student implements Comparable<Student> {
private String name;
private Integer id;
public Student(String name, Integer id) {
super();
this.name = name;
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Integer getId() {
return id;
}
public void setId(Integer id) {
this.id = id;
}
@Override
public String toString() {
return id+" "+name;
}
@Override
public int compareTo(Student o) {
if (o.getId() != id) {
return id - o.getId();//按升序排序,反之则降序排序o.getId() - id;
}
return (int) (name.compareTo(o.getName()));
}
public static void main(String[] args) {
List<Student> list = new ArrayList<Student>();
list.add(new Student("aaa", 123));
list.add(new Student("bbb", 123));
list.add(new Student("ccc", 256));
Collections.sort(list);//已经实现接口可以直接排序
for(Student s : list) {
System.out.println(s);
}
}
}
Comparator定制排序
public class Student {
private String name;
private Integer id;
public Student(String name, Integer id) {
super();
this.name = name;
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Integer getId() {
return id;
}
public void setId(Integer id) {
this.id = id;
}
@Override
public String toString() {
return id+" "+name;
}
public static void main(String[] args) {
List<Student> list = new ArrayList<Student>();
list.add(new Student("aaa", 123));
list.add(new Student("bbb", 123));
list.add(new Student("ccc", 256));
Collections.sort(list, new Comparator<Student>() {
@Override
public int compare(Student o1, Student o2) {
// TODO Auto-generated method stub
if(o1.getId()!=o2.getId()) {
return o1.getId()-o2.getId();
}
return (int) (o1.getName().compareTo(o2.getName()));
}
});
for(Student s : list) {
System.out.println(s);
}
}
}
练习
熟悉两种比较器后,我们可以写一道题练习一下杭电2093
这道题就是典型的排序题,考察排序,以及字符串的处理,题解如下:
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
List<Student> list = new ArrayList<Student>();
while (in.hasNext()) {//可以用Ctrl+Z停止输出
String s, s1;
s = in.next();
int sum1 = 0, sum2 = 0;
for (int j = 0; j < n; j++) {
int cur1 = 0, cur2 = 0;
s1 = in.next();
if (s1.charAt(0) == '-') {
continue;
}
int vv = s1.indexOf('(');//判断是否存在括号
if (vv != -1) {
cur2 = Integer.valueOf(s1.substring(vv + 1, s1.length() - 1));
cur1 = Integer.valueOf(s1.substring(0, vv));
} else {
cur1 = Integer.valueOf(s1);
if(cur1 == 0) {
continue;
}
}
sum1++;
sum2 += (cur1 + cur2 * k);
}
Student student = new Student(s, sum1, sum2);
list.add(student);
}
Collections.sort(list);
list.stream().forEach(item ->{
System.out.printf("%-10s %2d %4d\r\n", item.getName(), item.getNumber(), item.getTime());//这里注意格式化输入以及\n和\r\n的区别
});
in.close();
}
}
class Student implements Comparable<Student> {
private String name;
private int number;
private int time;
public Student(String name, int number, int time) {
// super();
this.name = name;
this.number = number;
this.time = time;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getNumber() {
return number;
}
public void setNumber(int number) {
this.number = number;
}
public int getTime() {
return time;
}
public void setTime(int time) {
this.time = time;
}
@Override
public int compareTo(Student o) {//重写方法进行排序
// TODO Auto-generated method stub
if (o.getNumber() != number) {
return o.getNumber() - number;
}
if (o.getTime() != time) {
return time - o.getTime();
}
return (int) (name.compareTo(o.getName()));
}
}
有错误欢迎评论区指正~~