collection,list,map 排序

本文介绍如何使用Java对不同类型的集合进行排序,包括Collection、List和Map等,并展示了如何自定义比较器以实现复杂的数据排序需求。

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

private void sortCollection(Collection<Map<String, Object>> coll) {
		List<Map<String, Object>> li = (List<Map<String, Object>>)coll;
		
		Collections.sort(li,new Comparator<Map<String, Object>>(){

			@Override
			public int compare(Map<String, Object> o1, Map<String, Object> o2) {
				return ((Float)o1.get("bl")).compareTo( (Float)o2.get("bl") );
			}  
	              
	    });  
		
	}


以上是对colllection的排序

TreeMap按照value进行排序

public class Testing {

    public static void main(String[] args) {

        HashMap<String,Double> map = new HashMap<String,Double>();
        ValueComparator bvc =  new ValueComparator(map);
        TreeMap<String,Double> sorted_map = new TreeMap<String,Double>(bvc);

        map.put("A",99.5);
        map.put("B",67.4);
        map.put("C",67.4);
        map.put("D",67.3);

        System.out.println("unsorted map: "+map);

        sorted_map.putAll(map);

        System.out.println("results: "+sorted_map);
    }
}

class ValueComparator implements Comparator<String> {

    Map<String, Double> base;
    public ValueComparator(Map<String, Double> base) {
        this.base = base;
    }

    // Note: this comparator imposes orderings that are inconsistent with equals.    
    public int compare(String a, String b) {
        if (base.get(a) >= base.get(b)) {
            return -1;
        } else {
            return 1;
        } // returning 0 would merge keys
    }
}

HashMap按值进行排序

public class MapUtil
{
    public static <K, V extends Comparable<? super V>> Map<K, V> 
        sortByValue( Map<K, V> map )
    {
        List<Map.Entry<K, V>> list =
            new LinkedList<Map.Entry<K, V>>( map.entrySet() );
        Collections.sort( list, new Comparator<Map.Entry<K, V>>()
        {
            public int compare( Map.Entry<K, V> o1, Map.Entry<K, V> o2 )
            {
                return (o1.getValue()).compareTo( o2.getValue() );
            }
        } );

        Map<K, V> result = new LinkedHashMap<K, V>();
        for (Map.Entry<K, V> entry : list)
        {
            result.put( entry.getKey(), entry.getValue() );
        }
        return result;
    }
}


下面详细介绍一下对Collections.sort()方法的使用



/**
* 
* 
* 
*/ 
package com.jabberchina.test;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class SortTest {
	
	
	
	public static void main(String[] args) {
		List lists = new ArrayList();
		List list = new ArrayList();
		List listB = new ArrayList();
		lists.add("5");
		lists.add("2");
		lists.add("9");
		//lists中的对象String 本身含有compareTo方法,所以可以直接调用sort方法,按自然顺序排序,即升序排序
		Collections.sort(lists);
		
		A aa = new A();
		aa.setName("aa");
		aa.setOrder(1);
		A bb = new A();
		bb.setName("bb");
		bb.setOrder(2);
		list.add(bb);
		list.add(aa);
		//list中的对象A实现Comparable接口
		Collections.sort(list);
		
		B ab = new B();
		ab.setName("ab");
		ab.setOrder("1");
		B ba = new B();
		ba.setName("ba");
		ba.setOrder("2");
		listB.add(ba);
		listB.add(ab);
		//根据Collections.sort重载方法来实现
		Collections.sort(listB,new Comparator(){
			@Override
			public int compare(B b1, B b2) {
				return b1.getOrder().compareTo(b2.getOrder());
			}
			
		});
		
		System.out.println(lists);
		System.out.println(list);
		System.out.println(listB);
		
	}

}

class A implements Comparable{
	private String name;
	private Integer order;
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	
	public Integer getOrder() {
		return order;
	}
	public void setOrder(Integer order) {
		this.order = order;
	}
	@Override
	public String toString() {
		return "name is "+name+" order is "+order;
	}
	@Override
	public int compareTo(A a) {
		return this.order.compareTo(a.getOrder());
	}
	
}

class B{
	private String name;
	private String order;
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public String getOrder() {
		return order;
	}
	public void setOrder(String order) {
		this.order = order;
	}
	@Override
	public String toString() {
		return "name is "+name+" order is "+order;
	}
}

打印的结果为:
 [2, 5, 9]
[name is aa order is 1, name is bb order is 2]
[name is ab order is 1, name is ba order is 2]

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值