Java 集合框架-TreeMap

一、整体代码

        TreeMapDemo.java

import java.util.*;
class Student 
{
    private String name;
    private int age;
    Student(String name,int age)
    {
        this.name = name;
        this.age = age;
    }
    public String getName()
    {
        return name;
    }
    public int getAge()
    {
        return age;
    }
    public String toString()
    {
        return name+":"+age;
    }

}




class StuNameComparator implements Comparator<Student>
{
    public int compare(Student s1,Student s2)
    {
        int num = s1.getName().compareTo(s2.getName());
        if(num==0)
        return new Integer(s1.getAge()).compareTo(new Integer(s2.getAge()));
        return num;
    }

}

public class  TreeMapDemo
{
    public static void main(String[] args) 
    {
        TreeMap<Student,String> tm = new TreeMap<Student,String>(new StuNameComparator());
        tm.put(new Student("blisi3",23),"nanjing");
        tm.put(new Student("lisi1",21),"beijing");
        tm.put(new Student("alisi4",24),"wuhan");
        tm.put(new Student("lisi1",21),"tianjin");
        tm.put(new Student("lisi2",22),"shanghai");
        Set<Map.Entry<Student,String>> entrySet = tm.entrySet();
        Iterator<Map.Entry<Student,String>> it = entrySet.iterator();
        while(it.hasNext())
        {
        Map.Entry<Student,String> me = it.next();
        Student stu = me.getKey();
        String addr = me.getValue();
        System.out.println(stu+":::"+addr);
        }
    }

}

二、解释

         TreeMap用于存放键值对，判断是否相等依然是compareTo返回0。可以对键进行排序。

    

    代码地址：https://github.com/jltxgcy/Demo