Briefly describe the difference between ArrayList and LinkedList
The differences between ArrayList and LinkedList are as follows:
- ArrayList is a data structure based on a dynamic array, and LinkedList is a data structure based on a linked list;
- For random access to get and set, ArrayList is better than LinkedList, because LinkedList needs to move the pointer;
- For the add and remove operations, generally everyone will say that LinkedList is faster than ArrayList because ArrayList needs to move data. But the actual situation is not the case. For adding or deleting, LinkedList and ArrayList cannot clearly indicate who is fast and who is slow.