不同点                                              顺序表                                                 链表 存储空间上                                 物理上一定连续                        逻辑上连续，但物理上不一定连续 随机访问                                         支持O(1)                                         不支持：O(N)               

任意位置插入或者删除元素    可能需要搬移元素，效率低O(N)           只需修改指针指向 插入                                   动态顺序表，空间不够时需要扩容                没有容量的概念 应用场景                                 元素高效存储+频繁访问                   任意位置插入和删除频繁 缓存利用率                                           高                                                        低