Java的中排序方式

实体类:


public class Person {
	public String getCode() {
		return code;
	}
	public void setCode(String code) {
		this.code = code;
	}
	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;
	}
	public String getAddress() {
		return address;
	}
	public void setAddress(String address) {
		this.address = address;
	}
	
	public String getSex() {
		return sex;
	}
	public void setSex(String sex) {
		this.sex = sex;
	}
	public Person(String code,String name,int age,String address,String sex){
		this.code = code;
		this.name = name;
		this.age = age;
		this.address = address;
		this.sex = sex;
	}
	private String code;
	private String name;
	private int age;
	private String address;
	private String sex; 
	
	public String toString(){
		return this.code + "-" + this.name + "-" + this.age + "-" + this.address + "-" +this.sex;
	}
}

 

一、Comparator接口排序

import java.util.Comparator;

/**
 * 根据年龄排序
 * @author wangxc
 *
 */
public class ageCompare implements Comparator<Person>{
	@Override
	public int compare(Person person1, Person person2) {
		// TODO Auto-generated method stub
		return (person1.getAge() - person2.getAge());
	}
}
import java.util.Comparator;

/**
 * 根据姓名排序
 * @author wangxc
 *
 */
public class nameCompare implements Comparator<Person>{
	@Override
	public int compare(Person person1, Person person2) {
		// TODO Auto-generated method stub
		return person1.getName().compareTo(person2.getName());
	}
}

 


import java.util.*;

public class Sort{

	public static void main(String[] args) throws Exception {

	    ArrayList<Person> persons = new ArrayList<Person>();
	    persons.add(new Person("001", "tom", 55, "NewYork","w"));
	    persons.add(new Person("042", "jack", 25, "China","w"));
	    persons.add(new Person("035", "allice", 39, "japan","m"));
	    persons.add(new Person("023", "lili", 21, "England","m"));
	    
	    ageCompare ac = new ageCompare();
	    Collections.sort(persons, ac);
	    System.out.println("sort by age" + persons);
	    
	    nameCompare nc = new nameCompare();
	    Collections.sort(persons, nc);
	    System.out.println("sort by name" + persons);
	}		
}

 


 二、Comparable接口排序,需要重写Comparable接口

修改实体类如下图所示,先根据年龄进行排序,再根据名字长度进行排序:


public class Person implements Comparable<Person>{
	public String getCode() {
		return code;
	}
	public void setCode(String code) {
		this.code = code;
	}
	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;
	}
	public String getAddress() {
		return address;
	}
	public void setAddress(String address) {
		this.address = address;
	}
	
	public String getSex() {
		return sex;
	}
	public void setSex(String sex) {
		this.sex = sex;
	}
	public Person(String code,String name,int age,String address,String sex){
		this.code = code;
		this.name = name;
		this.age = age;
		this.address = address;
		this.sex = sex;
	}
	private String code;
	private String name;
	private int age;
	private String address;
	private String sex; 
	
	public String toString(){
		return this.code + "-" + this.name + "-" + this.age + "-" + this.address + "-" +this.sex;
	}
	@Override
	public int compareTo(Person o) {
		// TODO Auto-generated method stub
		if (this.age < o.age) {  //
			return -1;
		}else if(this.age > o.age){
			return 1;
		}
		else {
			return this.name.compareTo(o.name);
		}
	}
}
import java.util.*;

public class hehe {

	public static void main(String[] args) throws Exception {

	    ArrayList<Person> persons = new ArrayList<Person>();
	    persons.add(new Person("001", "tom", 55, "NewYork","w"));
	    persons.add(new Person("042", "jack", 25, "China","w"));
	    persons.add(new Person("035", "allice", 39, "japan","m"));
	    persons.add(new Person("023", "lili", 21, "England","m"));
	    
	    Collections.sort(persons);
	    System.err.println(persons);
	}		
}

 


三、ArrayList.sort()  排序 

实体类无需修改代码,无需继承任何接口。

import java.util.*;

public class hehe {

	public static void main(String[] args) throws Exception {

	    ArrayList<Person> persons = new ArrayList<Person>();
	    persons.add(new Person("001", "tom", 55, "NewYork","w"));
	    persons.add(new Person("042", "jack", 25, "China","w"));
	    persons.add(new Person("035", "allice", 39, "japan","m"));
	    persons.add(new Person("023", "lili", 21, "England","m"));
	    
	    persons.sort((p1,p2) -> (p1.getAge() - p2.getAge()));//根据年龄进行排序
	    System.out.println(persons);
	}		
}

 


四、Comparator.comparing() 排序


import java.util.*;

public class hehe {

	public static void main(String[] args) throws Exception {

	    ArrayList<Person> persons = new ArrayList<Person>();
	    persons.add(new Person("001", "tom", 55, "NewYork","w"));
	    persons.add(new Person("042", "jack", 25, "China","w"));
	    persons.add(new Person("035", "allice", 39, "japan","m"));
	    persons.add(new Person("023", "lili", 21, "England","m"));
	  
	    //先根据年龄排序再根据名字排序最后反转序列
	 persons.sort(Comparator.comparing(Person::getAge).thenComparing(Person::getName).reversed());
	    System.out.println(persons);
	}		
}

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值