本文探讨了ArrayList与LinkedList这两种List接口实现方式的区别。ArrayList基于动态数组实现，适合随机访问；而LinkedList采用双向链表结构，更适合频繁插入和删除操作。由于LinkedList需要存储前后指针，因此在空间使用上不如ArrayList高效。
Basically, they are just two different implementations of List interface.
LinkedList is implemented with a double-linked list; ArrayList is implemented with a dynamically resizing array.
所以基本的区别于list和array的区别很像，就是for random access, ArrayList is better; for adding and deleting, LinkedList is better.
LinkedList takes more space since it has to store both previous and next pointer. So large lists prefer arrayList.
版权声明：本文为博主原创文章，未经博主允许不得转载。
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
