前言
Java.util包中的List接口繼承了Collection接口,用來(lái)存放對(duì)象集合,所以對(duì)這些對(duì)象進(jìn)行排序的時(shí)候,要么讓對(duì)象類自己實(shí)現(xiàn)同類對(duì)象的比較,要么借助比較器進(jìn)行比較排序。
學(xué)生實(shí)體類,包含姓名和年齡屬性,比較時(shí)先按姓名升序排序,如果姓名相同則按年齡升序排序。
第一種:實(shí)體類自己實(shí)現(xiàn)比較
(實(shí)現(xiàn)comparable接口:public interface Comparable<T>
,里面就一個(gè)方法聲明:public int compareTo(T o);
)
示例代碼:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
public class Student implements Comparable<Student>{ private String name; private int age; public Student() { super (); // TODO Auto-generated constructor stub } public Student(String name, int age) { super (); this .name = name; this .age = age; } public String getName() { return name; } public void setName(String name) { this .name = name; } public int getAge() { return age; } public void setAge( int age) { this .age = age; } @Override public int compareTo(Student o) { // TODO Auto-generated method stub int flag = this .name.compareTo(o.name); if (flag == 0 ) { flag = this .age - o.age; } return flag; } } |
然后利用List類的sort(Comparator<? super E> c)
方法或java.util.Collections
工具類的sort(List<T> list)
(其實(shí)里面就一句:list.sort(null);
)進(jìn)行排序:
1
2
3
4
5
6
7
|
List<Student> students = new ArrayList<Student>(); students.add( new Student( "a" , 10 )); students.add( new Student( "b" , 12 )); students.add( new Student( "b" , 11 )); students.add( new Student( "ac" , 20 )); students.sort( null ); //Collections.sort(students); |
結(jié)果:
1
2
3
4
|
a 10 ac 20 b 11 b 12 |
第二種:借助比較器進(jìn)行排序。
示例代碼:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
|
public class Student { private String name; private int age; public Student() { super (); // TODO Auto-generated constructor stub } public Student(String name, int age) { super (); this .name = name; this .age = age; } public String getName() { return name; } public void setName(String name) { this .name = name; } public int getAge() { return age; } public void setAge( int age) { this .age = age; } } |
比較器java.util.Comparator
類是一個(gè)接口(public interface Comparator<T>
),包含int compare(T o1, T o2);
等方法:
我們的比較器要實(shí)現(xiàn)該接口并實(shí)現(xiàn)compare
方法:
1
2
3
4
5
6
7
8
9
10
11
12
13
|
private class StudentComparator implements Comparator<Student> { @Override public int compare(Student o1, Student o2) { // TODO Auto-generated method stub int flag = o1.getName().compareTo(o2.getName()); if (flag == 0 ) { flag = o1.getAge() - o2.getAge(); } return flag; } } |
比較的時(shí)候可以利用List的sort(Comparator<? super E> c)
方法(或者java.util.Collections
工具類的sort(List<T> list, Comparator<? super T> c)
方法)進(jìn)行排序。
1
2
3
4
5
6
7
8
9
10
11
|
List<Student> students = new ArrayList<Student>(); students.add( new Student( "a" , 10 )); students.add( new Student( "b" , 12 )); students.add( new Student( "b" , 11 )); students.add( new Student( "ac" , 20 )); Test t = new Test(); students.sort(t. new StudentComparator()); //Collections.sort(students, t.new StudentComparator()); for (Student student : students) { System.out.println(student.getName()+ " " +student.getAge()); } |
結(jié)果跟第一種方法一樣:
1
2
3
4
|
a 10 ac 20 b 11 b 12 |
總結(jié)
以上就是關(guān)于Java中對(duì)List進(jìn)行排序的全部?jī)?nèi)容了,希望本文的內(nèi)容對(duì)大家的學(xué)習(xí)或者工作能帶來(lái)一定的幫助,如果有疑問(wèn)大家可以留言交流。
原文鏈接:http://blog.csdn.net/shangmingchao/article/details/47145569