java的工具类collections例子

import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.TreeSet;

public class CollectionsTest
{
	public static void main(String[] args)
	{
		TreeSet set = new TreeSet(new PeopleComparator());
		LinkedList list = new LinkedList();
		
		set.add(new People(10));
		set.add(new People(20));
		set.add(new People(30));
		
		System.out.println("orginal order:");
		for(Iterator it = set.iterator(); it.hasNext();)
		{
			People p = (People)it.next();
			System.out.println(p.age);
			list.add(p.age);
		}
				
		System.out.println("Maximum value : " + Collections.max(list));
		
		System.out.println("Minimum value : " + Collections.min(list));
		
		System.out.println("reverse order:");
		Comparator c = Collections.reverseOrder();
		Collections.sort(list,c);
		for(Iterator it = list.iterator(); it.hasNext();)
		{
			System.out.println(it.next());
		}
		
		System.out.println("random order:");
		Collections.shuffle(list);
		for(Iterator it = list.iterator(); it.hasNext();)
		{
			System.out.println(it.next());
		}
	}

}

class People
{
	int age;
	People(int age)
	{
		this.age = age;
	}
}

class PeopleComparator implements Comparator
{
	
	@Override
	public int compare(Object o1, Object o2)
	{
		People p1 = (People)o1;
		People p2 = (People)o2;
		return p1.age - p2.age;
	}
	
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值