java学习笔记 LinkedList

LinkedLiset的底层是以链表存储

LinkedList部分方法示例：

import java.util.LinkedList;

public class Test {
    public static void main(String[] args) {
        LinkedList a1 = new LinkedList();
        LinkedList a3 = new LinkedList();
        
        a1.add("A");a1.add(1,"B");a1.add("C");
        a1.addFirst("first");a1.addLast("last");
        
        System.out.println(a1.offer("last"));
        System.out.println(a1);
        
        a1.removeFirst();a1.removeLast();
        System.out.println(a1.removeLast());
        System.out.println(a1);
        
        LinkedList a2 = new LinkedList(a1);
        System.out.println("+++++++++++++++++++++++++++++++++++++++++++");
        System.out.println(a2);
        
       
        
        
        System.out.println("找到链表的表头element" + " " + a2.element());
        System.out.println("a2内容:" + " "+a2);
        System.out.println("找到但不删除链表的头peek" + " " + a2.peek());
        System.out.println("a2内容:" + " "+a2);
        
        System.out.println( "检索并移除表头remove" + " " + a2.remove());
        System.out.println("a2内容:" + " "+a2);
        System.out.println("找到并删除此链表的头poll" + " " + a2.poll());
        System.out.println("a2内容:" + " "+a2);
        
        a3.add("A");a3.add("B");a3.add("C");
        int j = a3.size();
        for(int i = 0;i < j;i++) {
            System.out.print(a3.poll() + " ");
            System.out.println("执行第" + i + "次" + a3);    
        }
        System.out.println(a3); 
               
        
          
    }
}

/*
public void addFirst(E e)
public void addLast(E e)
public boolean offer(E e)
public E removeFirst()
public E removeLast()
public E element()
public E peek()
public E poll()
public E remove()

for(int i = 0;i < (a3.size()+ 2);i++) {
  System.out.print(a3.poll() + " ");
    System.out.println("执行第" + i + "次" + a3);    
}

1.public boolean offer()与public void addLast()除了返回值不同还有别的什么不同之处么？
*/