TreeMap集合的应用根据学生的年龄或者姓名排序


/**
TreeMap练习

根据年龄排序。

根据姓名排序:

*/
import java.util.*;
class StuNameComparator implements Comparator<Student>
{
	//复写compare方法
	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;
	}
}
class  TreeMapTest
{
	public static void main(String[] args) 
	{
		TreeMap<Student,String > tm=new TreeMap<Student,String >(new StuNameComparator());//TreeMap可以将比较器传递到其对象内
		
		
		
		tm.put(new Student("zhangsan01",24),"beijing");
		tm.put(new Student("zhangsan04",32),"shenzheng");
		tm.put(new Student("zhangsan03",23),"shenzheng");
		tm.put(new Student("zhangsan02",20),"shnghai");
		//tm.put(new Student("zhangsan03",32),"shenzheng");

		//使用entrySet遍历
		Set<Map.Entry<Student,String>> entryset=tm.entrySet();
		Iterator<Map.Entry<Student,String>> it=entryset.iterator();
		while (it.hasNext())
		{
			Map.Entry<Student,String> map=it.next();
			Student key=map.getKey();
			String value=map.getValue();
			System.out.println(key+"=="+value);
		}
	}
}
创建学生类,定义一个比较器。<pre name="code" class="java">class Student implements Comparable<Student>//比较学生
{
	private String name;
	private int age;
	Student(String name ,int age){
		this.name=name;
		this.age=age;
	}
	public int  compareTo(Student s)
	{
		int num=new Integer(this.age).compareTo(new Integer(s.age));
		if (num==0)
		{
			return this.name.compareTo(s.name);
		}
		return num;
	}
	public int hashCode(){
		return this.name.hashCode()+age*34;
	}
	public boolean equals(Object obj){
		//判断类型是否相同
		if (!(obj instanceof Student))
		{
			throw new ClassCastException("类型不同");
		}
		Student s=(Student)obj;
		return this.name.equals(s.name) && this.age==s.age;
	}
	

	public String toString(){
		return name+":"+age;
	}
	public void setName(String name){
		this.name=name;
	}
	public String getName(){
		return name;
	}
	public void setAge(int age){
		this.age=age;
	}
	public int getAge(){
		return age;
	}


}


                
  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是Java代码实现: ```java import java.util.Map; import java.util.TreeMap; public class TestStudent { public static void main(String[] args) { Map<Student, String> map = new TreeMap<>((s1, s2) -> s2.getAge() - s1.getAge()); // 按照年龄从大到小排序 map.put(new Student("Tom", "Beijing", 18), "Address1"); map.put(new Student("Jerry", "Shanghai", 20), "Address2"); map.put(new Student("Alice", "Guangzhou", 22), "Address3"); map.put(new Student("Bob", "Shenzhen", 19), "Address4"); map.put(new Student("Lucy", "Hangzhou", 21), "Address5"); for (Map.Entry<Student, String> entry : map.entrySet()) { System.out.println(entry.getKey().toString() + " Address:" + entry.getValue()); } } } class Student { private String name; private String address; private int age; public Student(String name, String address, int age) { this.name = name; this.address = address; this.age = age; } public String getName() { return name; } public String getAddress() { return address; } public int getAge() { return age; } @Override public String toString() { return "Student{" + "name='" + name + '\'' + ", address='" + address + '\'' + ", age=" + age + '}'; } } ``` 输出结果为: ``` Student{name='Alice', address='Guangzhou', age=22} Address:Address3 Student{name='Lucy', address='Hangzhou', age=21} Address:Address5 Student{name='Jerry', address='Shanghai', age=20} Address:Address2 Student{name='Bob', address='Shenzhen', age=19} Address:Address4 Student{name='Tom', address='Beijing', age=18} Address:Address1 ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值