English
- Understand the collection system hierarchy.
- What is an iterator?
- What are the differences between
HashMap
and Hashtable
?
- How is the expansion operation of
HashMap
implemented?
- How does
HashMap
resolve hash collisions?
- Why doesn’t
HashMap
directly use the hash value processed by hashCode()
as the index for the table?
- What are the differences between
ConcurrentHashMap
and Hashtable
?
- What is the fail-fast mechanism in Java collections?
- What are the differences between
ArrayList
and Vector
?
- What are the differences between
ArrayList
and LinkedList
?
- How does
HashSet
ensure that data is not duplicated?
- What are the differences between
Set
and List
?
- What are the differences between
HashMap
and TreeMap
?
- What are the differences between
Collection
and Collections
?
- Explain the logic for selecting a collection implementation class.
Chinese
- 理解集合體系結構圖。
- 什麼是迭代器?
HashMap
與 Hashtable
的區別是什麼?
HashMap
的擴容操作是如何實現的?
HashMap
是如何解決哈希衝突的?
- 為什麼
HashMap
不直接使用 hashCode()
處理後的哈希值作為表的下標?
ConcurrentHashMap
和 Hashtable
的區別是什麼?
- Java 集合的快速失敗機制(Fail-Fast)是什麼?
ArrayList
和 Vector
的區別是什麼?
ArrayList
和 LinkedList
的區別是什麼?
HashSet
是如何保證數據不可重複的?
Set
和 List
的區別是什麼?
HashMap
與 TreeMap
的區別是什麼?
Collection
和 Collections
的區別是什麼?
- 介紹選擇集合實現類的邏輯。