Java List Set Map

水深无声 2024-03-23 23:12 5阅读 0赞

## 一、List ##

### 1.1 ArrayList ###

![7fe65ca0b33e4c2fa62863b941800a31.png][]

### 1.2 LinkedList ###

![2e7e741e7cc84881befe285c35b11ee2.png][]

## 二、Set ##

### 2.1 HashSet ###

![1ae47c8aa4af43229ecfd4de04d63d69.png][]

### 2.2 TreeSet ###

![9348491ad334476c9a899aa498d2ea7f.png][]

### 2.3 LinkedHashSet ###

![4d88f07cd30540adbfb38e20c3de44c5.png][]

## 三、Map ##

### 3.1 HashMap ###

![7446399645af44cfb2d4e9ace06184ca.png][]

### 3.2 TreeMap ###

![1a4622d7eb304272a11fe39a72fad4ba.png][]

### 3.3 LinkedHashMap ###

![cbc365df953c4e53bec9d71632966356.png][]

## 四、对比 ##

<table> 
 <tbody> 
  <tr> 
   <td></td> 
   <td>类型</td> 
   <td>底层结构</td> 
   <td>重复</td> 
   <td>null值</td> 
   <td>场景</td> 
   <td>备注</td> 
   <td>查询</td> 
   <td>删除</td> 
   <td>新增</td> 
  </tr> 
  <tr> 
   <td colspan="1">List</td> 
   <td>ArrayList</td> 
   <td>动态数组</td> 
   <td>可</td> 
   <td>允许</td> 
   <td>快速随机访问元素</td> 
   <td></td> 
   <td>0(1)</td> 
   <td>0(n)</td> 
   <td>尾部增加0（1）,中部增加0（n）</td> 
  </tr> 
  <tr> 
   <td>LinkList</td> 
   <td>双向链表</td> 
   <td>可</td> 
   <td>允许</td> 
   <td>需要快速插入，删除元素</td> 
   <td></td> 
   <td>0(n)</td> 
   <td>0(1)</td> 
   <td>尾部增加0（1）,中部增加0（n）</td> 
  </tr> 
  <tr> 
   <td colspan="1">Set</td> 
   <td>HashSet</td> 
   <td>数组+（链表、红黑树）</td> 
   <td>不可</td> 
   <td>允许</td> 
   <td>不要求顺序，且没有重复元素</td> 
   <td>重写hsahCode、equlas</td> 
   <td>0(1)</td> 
   <td>0(1)</td> 
   <td>0(1)</td> 
  </tr> 
  <tr> 
   <td>TreeSet</td> 
   <td>红黑树</td> 
   <td>不可</td> 
   <td>不允许</td> 
   <td>要求顺序，且没有重复元素</td> 
   <td>重写comparato</td> 
   <td>0(logN)</td> 
   <td>0(logN)</td> 
   <td>0(logN)</td> 
  </tr> 
  <tr> 
   <td>LinkedHashSet</td> 
   <td>数组+（链表、红黑树））+链表</td> 
   <td>不可</td> 
   <td>允许</td> 
   <td>有特定输出顺序，且没有重复元素</td> 
   <td></td> 
   <td>0(1)</td> 
   <td>0(1)</td> 
   <td>0(1)</td> 
  </tr> 
  <tr> 
   <td colspan="1">Map</td> 
   <td>HashMap</td> 
   <td>数组+（链表、红黑树）</td> 
   <td>不可</td> 
   <td>允许</td> 
   <td>键值存取，而且不要求顺序</td> 
   <td>时间复杂度平均能达到O(1)。正常是O(1)到O（n） jdk1.8添加了 红黑树 是 O（log n）</td> 
   <td>0(1)</td> 
   <td>0(1)</td> 
   <td>0(1)</td> 
  </tr> 
  <tr> 
   <td>TreeMap</td> 
   <td>红黑树</td> 
   <td>不可</td> 
   <td>不允许</td> 
   <td>键值存取值，而且要求顺序</td> 
   <td>重写comparato</td> 
   <td>0(logN)</td> 
   <td>0(logN)</td> 
   <td>0(logN)</td> 
  </tr> 
  <tr> 
   <td>LinkedHashMap</td> 
   <td>（数组+（链表、红黑树））+链表</td> 
   <td>不可</td> 
   <td>允许</td> 
   <td>有特定输出顺序键，键值存取</td> 
   <td></td> 
   <td>0(1)</td> 
   <td>0(1)</td> 
   <td>0(1)</td> 
  </tr> 
 </tbody> 
</table>

[7fe65ca0b33e4c2fa62863b941800a31.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/13/684763e0052b47a38324ff3867ed980c.png
[2e7e741e7cc84881befe285c35b11ee2.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/13/27c934e963f64436a212aaf7ecbb24e2.png
[1ae47c8aa4af43229ecfd4de04d63d69.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/13/96e92cd469e9438da4512ef1534909d7.png
[9348491ad334476c9a899aa498d2ea7f.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/13/04897cbebc6c43c2bd1835b23f0df01c.png
[4d88f07cd30540adbfb38e20c3de44c5.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/13/211961a76d3443f7a48b1b33a8dc2570.png
[7446399645af44cfb2d4e9ace06184ca.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/13/fd758c2881fc4872a81deffe46eff2f6.png
[1a4622d7eb304272a11fe39a72fad4ba.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/13/b8c2d5de87484c569cbec8b82b8bf6b5.png
[cbc365df953c4e53bec9d71632966356.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/13/cc3fa1aa44f8445eb33e367ac9aff0fb.png