Java集合框架LinkedList详解及实例

package java.util;
public class LinkedList
 extends AbstractSequentialList
 implements List, Deque, Cloneable, java.io.Serializable{
 transient int size = 0;
 transient Node first;
 transient Node last;
}

 private static class Node {
  E item;
  Node next;
  Node prev;

  Node(Node prev, E element, Node next) {
   this.item = element;
   this.next = next;
   this.prev = prev;
  }
 }

 public E get(int index) {
  checkElementIndex(index);
  return node(index).item;
 }
 public E set(int index, E element) {
  checkElementIndex(index);
  Node x = node(index);
  E oldVal = x.item;
  x.item = element;
  return oldVal;
 }

 Node node(int index) {
  // assert isElementIndex(index);

  if (index <(size >> 1)) {
   Node x = first;
   for (int i = 0; i  x = last;
   for (int i = size - 1; i > index; i--)
    x = x.prev;
   return x;
  }
 }

  List list = new LinkedList<>();
  list.add(4);
  list.add(2);
  list.add(3);
  list.add(5);

  for(int i:list)
   System.out.println(i);
  System.out.println(list);

4
2
3
5
[4, 2, 3, 5]

 List list = new LinkedList<>();
  list.add(4);
  list.add(2);
  list.add(3);
  list.add(5);
  list.add(7);
  list.add(5);
  list.add(11);
  list.add(14);
  list.add(10);
  list.add(9);
  System.out.println(list);
  List list2 = list.subList(3, 6);
  System.out.println(list2);
  list2.set(2, 50);

  System.out.println("============");
  System.out.println(list);
  System.out.println(list2);

[4, 2, 3, 5, 7, 5, 11, 14, 10, 9]
[5, 7, 5]
============
[4, 2, 3, 5, 7, 50, 11, 14, 10, 9]
[5, 7, 50]