TreeMap和HashMap的区别

import java.util.Map;
import java.util.HashMap;
import java.util.TreeMap;
public class HashMapVsTreeMapExample
{
    public static void main(String args[])
    {
        /*------------HashMap implementation----------------*/
        Map<Integer, String> hm=new HashMap<Integer, String>();
//adding elements to the HashMap
        hm.put(9, "Red");
        hm.put(12, "Black");
        hm.put(6, "Green");
        hm.put(19, "White");
        System.out.println("HashMap iteration Order:");
//iteration over map using for each loop
        for(Map.Entry<Integer, String>entry: hm.entrySet())
        {
//getting keys and values using method
            System.out.println(entry.getKey() + " = " +entry.getValue());
        }
        /*------------TreeMap implementation----------------*/
        Map<Integer, String> tm=new TreeMap<Integer, String>();
//adding elements to the TreeMap
        tm.put(9, "Red");
        tm.put(12, "Black");
        tm.put(6, "Green");
        tm.put(19, "White");
        System.out.println("TreeMap iteration Order:");
        //iteration over map using for each loop
        for(Map.Entry<Integer, String>entry: tm.entrySet())
        {
//getting keys and values using method
//prints list in sorted order
            System.out.println(entry.getKey() + " = " +entry.getValue());
        }
    }
}

运行结果:

HashMap iteration Order:
19 = White
6 = Green
9 = Red
12 = Black
TreeMap iteration Order:
6 = Green
9 = Red
12 = Black
19 = White

评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值