s-day04--LinkedHashMap的特点
This commit is contained in:
@@ -0,0 +1,21 @@
|
||||
package com.inmind.map01;
|
||||
|
||||
import java.util.LinkedHashMap;
|
||||
import java.util.Map;
|
||||
|
||||
/*
|
||||
6.LinkedHashMap的特点
|
||||
hash:哈希表,它的作用去重,通过hashCode和equals
|
||||
link:链表,保证有序
|
||||
|
||||
LinkedHashMap:存取有序,没有索引,不能重复的,一个双列集合
|
||||
*/
|
||||
public class MapDemo05 {
|
||||
public static void main(String[] args) {
|
||||
LinkedHashMap<Integer, String> map = new LinkedHashMap<>();
|
||||
map.put(2, "关羽");
|
||||
map.put(3, "张飞");
|
||||
map.put(1, "刘备");
|
||||
System.out.println(map);
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user