LinkedList 类

 

package com.oracle.demo01;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;

public class Demo01 {
    public static void main(String[] args) {
        //ArrayList  数组结构：查询快，增删慢
        //LinkedList  链表结构：查询慢，增删快
        LinkedList<String> arr=new LinkedList<String>();
        arr.add("hello");
        arr.addFirst("范闲");
        arr.addLast("范若若");
        
        //删除
        arr.removeFirst();
        arr.removeLast();
                
        //遍历
        for(String p:arr){
            System.out.println(p);
        }
        
        //获取
        System.out.println(arr.getFirst());
        System.out.println(arr.getLast());
        
        //判断是否为空
        System.out.println(arr.isEmpty());
        
        
    }
}

 练习

package com.oracle.demo01;

import java.util.LinkedList;

public class AmWork {
    public static void main(String[] args) {
        LinkedList<String> list=new LinkedList<String>();
        list.add("a");
        list.add("b");
        list.add("c");
        list.add("d");
        list.add("e");
        list.add("f");
        
        get(list);
        list.add("a");
        list.add("b");
        list.add("c");
        list.add("d");
        list.add("e");
        list.add("f");
        System.out.println();
        ge(list);
    }
    //先进后出：堆栈
    public static void get(LinkedList<String> list){
        /*int t=list.size();
        for (int i = 0; i < t; i++) {
            System.out.print(list.getLast());
            list.removeLast();
        }*/
        while(!list.isEmpty()){
            System.out.print(list.getLast());
            list.removeLast();
        }
    }
    //先进先出：队列
    public static void ge(LinkedList<String> list){
        /*int t=list.size();
        for (int i = 0; i < t; i++) {
            System.out.print(list.getFirst());
            list.removeFirst();
        }*/
        while(!list.isEmpty()){
            System.out.print(list.getFirst());
            list.removeFirst();
        }
    }
}

 

.