您需要实现可比接口
implements Comparable
该做的工作是
public int compareTo(Object obj)
{
}
请注意,对象往往是取而代之的是一个完整的对类型,因为一般语法的方法它可以在实现语句中使用(如下所示)。
完整的例子就是here in the tutorial docs希望这有助于
完整的例子(采取从上面的链接如下),我刚才的情况下添加此链接出现死在某个时刻
import java.util.*;
public class Name implements Comparable<Name> {
private final String firstName, lastName;
public Name(String firstName, String lastName) {
if (firstName == null || lastName == null)
throw new NullPointerException();
this.firstName = firstName;
this.lastName = lastName;
}
public String firstName() { return firstName; }
public String lastName() { return lastName; }
public boolean equals(Object o) {
if (o == null || !(o instanceof Name))
return false;
Name n = (Name) o;
return n.firstName.equals(firstName) && n.lastName.equals(lastName);
}
public int hashCode() {
return 31*firstName.hashCode() + lastName.hashCode();
}
public String toString() {
return firstName + " " + lastName;
}
public int compareTo(Name n) {
int lastCmp = lastName.compareTo(n.lastName);
return (lastCmp != 0 ? lastCmp : firstName.compareTo(n.firstName));
}
}
从文章的客户端代码:
import java.util.*;
public class NameSort {
public static void main(String[] args) {
Name nameArray[] = {
new Name("John", "Smith"),
new Name("Karl", "Ng"),
new Name("Jeff", "Smith"),
new Name("Tom", "Rich")
};
List<Name> names = Arrays.asList(nameArray);
Collections.sort(names);
System.out.println(names);
}
}
贵教授想要实现的排序算法自己呢? – 2012-04-13 17:33:41
@joncarl说的是一个好点,如果是的话,你需要查看bubblesort(它相当容易实现,但不是那么快) – 2012-04-13 17:40:32
是的,我会实现插入排序算法。 – user1253201 2012-04-13 18:24:00