What is the difference between linkedlist and arraylist

LinkedeList and ArrayList are two commonly used storage structures, both of which can implement the List interface. So what is the difference between them? The following article will take you to understand the difference between LinkedeList and ArrayList. I hope it will be helpful to you.

The difference between LinkedeList and ArrayList

1. Different data structures

ArrayList is the data structure of Array (dynamic array), and LinkedList is the data structure of Link (linked list).

2. Different efficiency

When accessing List randomly (get and set operations), ArrayList is more efficient than LinkedList because LinkedList is a linear data storage method. , so you need to move the pointer to search from front to back.

When adding and deleting data (add and remove operations), LinkedList is more efficient than ArrayList. Because ArrayList is an array, when adding or deleting operations are performed in it, all operations after the operation point will be performed. The subscript index of the data is affected and the data needs to be moved. [Video tutorial recommendation:Java video tutorial]

3. Different freedom

ArrayList has less freedom because it requires manual settings It has a fixed size capacity, but it is more convenient to use. You only need to create, then add data, and use it by calling the subscript; while LinkedList has higher freedom and can dynamically change with the change of data volume, but it is not easy to use. .

4. The main control overhead is different

The main control overhead of ArrayList is that a certain space needs to be reserved in the lList list; while the main control overhead of LinkList is the need to store node information and Node pointer information.

Related recommendations:

java development learning tutorial [Recommended]

The above is the detailed content of What is the difference between linkedlist and arraylist. For more information, please follow other related articles on the PHP Chinese website!