Map的实现类:TreeMap

1.存储结构:红黑树

2.实现了SortedMap接口(是Map的子接口),可以对key自动排序。

3.实例代码:Student类和Demo03

如果出现类转换异常  参考【TreeSet(红黑树)

package com.map;

import java.util.Objects;

public class Student implements Comparable<Student>{
    private String name;
    private int stuNo;

    public Student(String name, int stuNo) {
        this.name = name;
        this.stuNo = stuNo;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getStuNo() {
        return stuNo;
    }

    public void setStuNo(int stuNo) {
        this.stuNo = stuNo;
    }

    @Override
    public String toString() {
        return "Student [name=" + name + ", stuNo=" + stuNo + "]";
    }

    @Override
    public int compareTo(Student o) {
        int n1 = this.getStuNo()-o.getStuNo();
        int n2 = this.name.compareTo(o.getName());
        return n1==0?n1:n2;
    }
}
package com.map;

import java.util.Map;
import java.util.Set;
import java.util.TreeMap;

/**
 * TreeMap集合的使用
 * 存储结构:红黑树
 */
public class Demo03 {
    public static void main(String[] args) {
        //创建集合
        TreeMap<Student, String> treeMap = new TreeMap<>();
        //创建学生对象
        Student s1 = new Student("小王", 100);
        Student s2 = new Student("小刘", 101);
        Student s3 = new Student("小方", 102);
        Student s4 = new Student("小舟", 103);
        //1添加数据
        treeMap.put(s1,"北京");
        treeMap.put(s2,"上海");
        treeMap.put(s3,"福建");
        treeMap.put(s4,"重庆");
        System.out.println("学生个数:"+treeMap.size());
        System.out.println(treeMap);

        //2删除数据
        treeMap.remove(s1);
        System.out.println(treeMap);

        //3遍历数据
        System.out.println("--------keySet()-----------");
        Set<Student> set = treeMap.keySet();
        for(Student s : set){
            System.out.println(s);
        }
        System.out.println("--------entrySet()-----------");
        Set<Map.Entry<Student, String>> entries = treeMap.entrySet();
        for(Map.Entry<Student, String> entry : entries){
            System.out.println(entry.getKey()+" "+entry.getValue());
        }
    }
}

结果:

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值