LinkedList总结
LinkedList分点详解
LinkedList继承实现情况
![在这里插入图片描述](https://img-blog.csdnimg.cn/3a5c73802d60455f8222ea9db6d2cc0b.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA6aKc54uX5aSH5b-Y5b2V,size_20,color_FFFFFF,t_70,g_se,x_16#pic_center)
LinkedList数据结构
- 链表节点类型为内部类
private static class Node<E> {
E item;
Node<E> next;
Node<E> prev;
Node(Node<E> prev, E element, Node<E> next) {
this.item = element;
this.next = next;
this.prev = prev;
}
}
- 默认新增数据就是直接在链表终端添加元素
public boolean add(E e) {
linkLast(e);
return true;
}
void linkLast(E e) {
final Node<E> l = last;
final Node<E> newNode = new Node<>(l, e, null);
last = newNode;
if (l == null)
first = newNode;
else
l.next = newNode;
size++;
modCount++;
}