自定义类的数组排序

思路：实现Comparable的接口里的compareTo方法。

 /* * To change this template, choose Tools | Templates * and open the template in the editor. */ package 结构和内部类; import java.util.Arrays; /** * * @author 姚强 */ public class EmployeeSortTest { public static void main(String arg[]) { Employee[] staff = new Employee[3]; staff[0] = new Employee("yao", 90000); staff[1] = new Employee("qiang", 20000); staff[2] = new Employee("hehe", 30000); Arrays.sort(staff); for (Employee e : staff) { System.out.println("name=" + e.getName() + ";salary=" + e.getSalary()); } } } class Employee implements Comparable<Employee> { private String name; private double salary; public Employee(String name, double s) { this.name = name; this.salary = s; } public String getName() { return name; } public void setName(String name) { this.name = name; } public double getSalary() { return salary; } public void setSalary(double salary) { this.salary = salary; } public int compareTo(Employee o) { if (this.salary < o.salary) { return -1; } if (this.salary > o.salary) { return 1; } return 0; } }

运行结果：

run: name=qiang;salary=20000.0 name=hehe;salary=30000.0 name=yao;salary=90000.0 成功生成（总时间：2 秒）