Comparison of the differences between ArrayList and LinkedList

ArrayList：

advantage :ArrayList Is the implementation of a dynamic array based data structure , Because the address is continuous , Once the data is stored , Inquire about The operation efficiency will be relatively high ( It's connected in memory ).
shortcoming : Because the address is continuous ,ArrayList To move data , So insert and delete operations are less efficient .

LinkedList：

advantage :LinkedList Data structures based on linked lists , The address is arbitrary , So there is no need to wait when opening up memory space A continuous address . For new and delete operations ,LinkedList predominance .LinkedList Suitable for head and tail exercises Make or insert the scene at the specified position .
shortcoming : because LinkedList To move the pointer , So the query operation performance is relatively low .

Applicable scenario analysis
When random access to data is needed , choose ArrayList.

When the data needs to be added, deleted and modified multiple times , use LinkedList. If the capacity is fixed , And will only be added to the tail , It will not cause capacity expansion , Give priority to ArrayList.

Of course , In most business scenarios , Use ArrayList That's enough , But care should be taken to avoid ArrayList Expansion of , And non smooth Insertion of order .