List set 排序算法改写

本文提供了一个使用Java对List和Set中的自定义对象进行排序的例子。通过实现Comparator接口,可以根据对象的不同属性(如ID和年龄)进行升序或降序排列。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

list的排序算法改写

public class Main2 {

	public static void main(String[] args) {
		List<student> l = new ArrayList<student>();
		student stu1 = new student("001","aaa",18);
		student stu2 = new student("002","bbb",19);
		student stu3 = new student("003","ccc",22);
		student stu4 = new student("004","ddd",14);
		student stu5 = new student("005","eee",17);
		
		l.add(stu1);
		l.add(stu4);
		l.add(stu3);
		l.add(stu5);
		l.add(stu2);
		
		Iterator<student> it = l.iterator();
		while(it.hasNext()){
			System.out.println(it.next());
		}
		//排序
		System.out.println("-----------qian----------");
		Collections.sort(l, new Comparator<student>() {

			@Override
			public int compare(student o1, student o2) {
				if(o1.ID.compareTo(o2.ID)==0){
					return o2.age-o1.age;
				}
				return o2.ID.compareTo(o1.ID);//从大到小   o1在前是从小到大
			}
		});
		
		Iterator<student> it1 = l.iterator();
		while(it1.hasNext()){
			System.out.println(it1.next());
		}
		System.out.println("-----------hou----------");
	}

}


set的排序算法改写


public class Main {

	public static void main(String[] args) {
		Set<student> setlist = new HashSet<student>();
		student stu1 = new student("001","abc",18);
		student stu2 = new student("002","def",18);
		student stu3 = new student("003","hhh",18);
		student stu4 = new student("001","abc",18);
		
		setlist.add(stu1);
		setlist.add(stu2);
		setlist.add(stu3);
		setlist.add(stu4);
		System.out.println(stu1.equals(stu4));//判断stu1与stu2是否一样
		
		Iterator<student> it = setlist.iterator();
		while(it.hasNext()){
			System.out.println(it.next());
		}
		
		List<student> list = new ArrayList<student>(setlist);
		System.out.println("-----------qian----------");
		Collections.sort(list, new Comparator<student>() {

			@Override
			public int compare(student o1, student o2) {
				if(o1.ID.compareTo(o2.ID)==0){
					return o2.age-o1.age;
				}
				return o2.ID.compareTo(o1.ID);//从大到小   o1在前是从小到大
			}
		});
		
		Iterator<student> it1 = list.iterator();
		while(it1.hasNext()){
			System.out.println(it1.next());
		}
		System.out.println("-----------hou----------");

	}

}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值