Java TreeMap练习(1) (2024.7.28)

        TreeMapExercise1

package TreeMapExercise20240728;

import java.util.Map;
import java.util.TreeMap;
import java.util.function.BiConsumer;

public class TreeMapExercise1 {
    public static void main(String[] args) {
        // TreeMap是Map接口的实现类,其底层是红黑树的结构,是可以进行排序的集合
        Map<String, Integer> treeMap = new TreeMap<>();
        treeMap.put("Apple", 5);
        treeMap.put("Water", 2);
        treeMap.put("Pear", 5);
        treeMap.put("chip", 7);
        treeMap.put("cake", 15);
        System.out.println(treeMap);
        treeMap.forEach((s, integer) -> System.out.println(s + " : " + integer));
    }
}

        TreeMapExercise2

package TreeMapExercise20240728;
import java.util.Comparator;
import java.util.Objects;
import java.util.TreeMap;

public class TreeMap20240728 {
    public static void main(String[] args) {
        /* 案例需求
        创建一个TreeMap集合,键是学生对象(Student),值是籍贯(String),学生属性姓名和年龄,按照年龄进行
        排序并遍历。要求按照学生的年龄进行排序,如果年龄相同则按照姓名进行排序 */

        // 创建学生的TreeMap集合,并且使用Comparator比较器
        TreeMap<Student, String> studentTreeMap = new TreeMap<>();

        // 创建学生对象
        Student s1 = new Student("张三", 25);
        Student s2 = new Student("李四", 27);
        Student s3 = new Student("王五", 24);
        Student s4 = new Student("赵六", 30);
        Student s5 = new Student("钱七", 23);
        Student s6 = new Student("张三", 25);

        studentTreeMap.put(s1, "重庆");
        studentTreeMap.put(s2, "四川");
        studentTreeMap.put(s3, "西安");
        studentTreeMap.put(s4, "北京");
        studentTreeMap.put(s5, "上海");
        studentTreeMap.put(s6, "USA");

        System.out.println(studentTreeMap);

        studentTreeMap.forEach((key, value) -> System.out.println(key + " : " + value));
    }
}

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

    public Student() {
        this("testStudent", 20);
    }

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

    public String getName() {
        return name;
    }

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

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", age=" + age +
                '}';
    }

    @Override
    public int compareTo(Student o) {
        int result = this.getAge() - o.getAge();
        result = (result == 0) ? this.getName().compareTo(o.getName()) : result;
        return result;
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值