Java LinkedList

Java LinkedList

1.LinkedList底层数据结构是链表，删除和添加元素的效率比较高，数据结构复杂
（1）单项链表和双向链表
2.ArrayList底层数据结构是数组，删除和添加元素效率比较低

import java.util.LinkedList;

public class textLinkedList {
	/*源码
	 * private void linkFirst(E e) {
        final Node<E> f = first;
        final Node<E> newNode = new Node<>(null, e, f);
        first = newNode;
        if (f == null)
            last = newNode;
        else
            f.prev = newNode;
        size++;
        modCount++;
    }
	 */
	public static void main(String[] args) {
		LinkedList list=new LinkedList();
		//添加元素
		list.add("hello");
		list.addFirst("java");
		list.addLast("world");
		//删除元素
		list.removeLast();//删尾
		list.removeFirst();//删头
		list.remove();//删头
		System.out.println(list);
		//遍历
		for(Object obj: list) {
			System.out.println(obj);
		}
	}
}