数组和集合的排序

首先新建一个类Employee,实现Comparable接口,指定排序规则。

public class Employee implements Comparable{
	private String name;
	private int 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;
	}
	
	public Employee(){
		
	}
	public Employee(String name) {
		super();
		this.name = name;
	}
	public Employee(String name, int age) {
		super();
		this.name = name;
		this.age = age;
	}
	
	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + ((name == null) ? 0 : name.hashCode());
		return result;
	}
	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		Employee other = (Employee) obj;
		if (name == null) {
			if (other.name != null)
				return false;
		} else if (!name.equals(other.name))
			return false;
		return true;
	}
	@Override
	public String toString() {
		return "Employee [name=" + name + ", age=" + age + "]";
	}
	@Override
	public int compareTo(Object o) {
		Employee emp = (Employee)o;
		return this.name.compareTo(emp.name);
	}
}


数组的排序通过Arrays类的sort方法,集合的排序通过Collections.sort()

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;

public class SortTest {
	public static void main(String[] args) {
		//sortBaseType();
		sortReferenceType();
		//sortCollectionType();
	}
	
	// 基本类型的数组的排序
	static void sortBaseType(){
		int[] intArr = new int[]{1,31,5,12,9,56};
		Arrays.sort(intArr);
		
		for(int i : intArr){
			System.out.print(i+" ");
		}
		System.out.println();
		System.out.println(Arrays.binarySearch(intArr, 12));
	}
	
	// 自定义类型数组的排序
	static void sortReferenceType(){
		Employee[] emps = new Employee[3];
		emps[0] = new Employee("wanghaijun",26);
		emps[1] = new Employee("mayu",24);
		emps[2] = new Employee("luxiangdong",25);
		
		Arrays.sort(emps);
		for(Employee emp : emps){
			System.out.print(emp.getName()+" ");
		}
		System.out.println();
		System.out.println(Arrays.binarySearch(emps, new Employee("mayu",24)));
	}
	
	// 集合的排序
	static void sortCollectionType(){
		List<employee> list = new ArrayList<employee>();
		list.add(new Employee("wanghaijun",26));
		list.add(new Employee("mayu",24));
		list.add(new Employee("luxiangdong",25));
		
		Collections.sort(list);
		Iterator<employee> iter = list.iterator();
		Employee emp = null;
		while(iter.hasNext()){
			emp = iter.next();
			System.out.print(emp.getName()+" ");
		}
	}
}</employee></employee></employee>

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值