Map的两种遍历方式:

Map的两种遍历方式:

首先,Map是双列集和的顶级接口。

public interface Map<K,V> :

K:键 V:值

K —> V的关系称为映射

将键映射到值的对象。一个映射不能包含重复的键;每个键最多只能映射到一个值。

keySet遍历

Set<K> keySet():返回此映射中包含的键的 Set 视图。

entrySet遍历

Set<Map.Entry<K,V>> entrySet():返回此映射中包含的映射关系的 Set 视图。

这两种遍历方式均不支持addaddAll 操作。

我们通过例子具体感受:

自定义汽车类:

public class Car implements Comparable<Car>{
    private String brand;//品牌
    private int year; //制造年份
    public Car() {}
    public Car(String brand, int year) {
        this.brand = brand;
        this.year = year;
    }
    public void setBrand(String brand) {
        this.brand = brand;
    }
    public String getBrand(){
        return brand;
    }
    public void setYear(int year) {
        this.year = year;
    }
    public int getYear(){
        return year;
    }

    @Override
    public int compareTo(Car o) {
        int num = this.year - o.year;
        if(num == 0 && this.brand.equals(o.brand)){
            return 0;
        }
        return num;
    }
}

两种遍历具体实现:

import java.util.*;

public class Test1 {
    public static void main(String[] args) {
        // 2、请编写程序,存储自定义对象到HashMap集合中,并采用两种方式遍历
        HashMap<Car, String> carMap = new HashMap<>();
        carMap.put(new Car("大众", 2000), "孙鲁班");
        carMap.put(new Car("桑塔纳", 2002), "孙鲁育");
        carMap.put(new Car("夏利", 1990), "吴国太");
        carMap.put(new Car("保时捷", 2015), "黄月英");
        carMap.put(new Car("宝马", 2020), "糜夫人");

        // keySet方法遍历
        Set<Car> cars = carMap.keySet();
        for (Car car : cars) {
            System.out.println(carMap.get(car) + "开着" + car.getYear() + "产的" + car.getBrand() + "喝大碗的恩希玛喽");
        }
        System.out.println("================================================================");
        // entrySet方法遍历
        Set<Map.Entry<Car, String>> entries = carMap.entrySet();
        for (Map.Entry<Car, String> entry : entries) {
            System.out.println(entry.getValue() + "开着" + entry.getKey().getYear() + "产的" + entry.getKey().getBrand() + "喝了两大碗的恩希玛");
        }
        System.out.println("================================================================");
        // 3、请编写程序,存储自定义对象到TreeMap集合中,并采用两种方式遍历
        // keySet方法遍历,根据汽车生产年份排序 自然排序
        TreeMap<Car, String> carsTree = new TreeMap();
        carsTree.put(new Car("丰田", 2019), "刘焉");
        carsTree.put(new Car("五菱宏光", 2015), "许攸");
        carsTree.put(new Car("本田", 2016), "关平");
        carsTree.put(new Car("雷诺", 2035), "赵琪瑛");
        carsTree.put(new Car("雪铁龙", 2055), "刘禅");
        carsTree.put(new Car("迈巴赫", 2016), "糜竺");
        // System.out.println(carsTree.get(car) + "坐着" + car.getYear() +"产的" +car.getBrand() + "喝芝麻酱和红糖");
        Set<Car> cars1 = carsTree.keySet();
        Iterator<Car> it = cars1.iterator();
        for (Car car : cars1) {
            System.out.println(carsTree.get(it.next()) + "坐着" + car.getYear() + "产的" + car.getBrand() + "喝芝麻酱和红糖");
        }
        System.out.println("================================================================");
        // entrySet方法遍历,比较器比较
        TreeMap<Car, String> carsTree2 = new TreeMap<>(new Comparator<Car>() {
            @Override
            public int compare(Car o1, Car o2) {
                int num = o1.getYear() - o2.getYear();
                if (num == 0 && o1.getBrand().equals(o2.getBrand())) {
                    return 0;
                }
                return num;
            }
        });
        carsTree2.put(new Car("丰田", 2016), "刘焉");
        carsTree2.put(new Car("五菱宏光", 2015), "许攸");
        carsTree2.put(new Car("本田", 2003), "关平");
        carsTree2.put(new Car("雷诺", 2035), "赵琪瑛");
        carsTree2.put(new Car("雪铁龙", 2055), "刘禅");
        carsTree2.put(new Car("迈巴赫", 2016), "糜竺");

        Set<Map.Entry<Car, String>> entries2 = carsTree2.entrySet();
        for (Map.Entry<Car, String> carStringEntry : entries2) {
            System.out.println(carStringEntry.getValue() + "开着" + carStringEntry.getKey().getYear() + "产的" + carStringEntry.getKey().getBrand() + "去吃腰果鸡丁");
        }
    }
}

两种方法具体可根据JDK帮助文档详细查看。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值