Java基于双链表实现栈和队列封装

MyLinkedList代码见

MyLinkedList

栈封装

import java.util.NoSuchElementException;

public class MyStack<E> {
    private MyLinkedList<E>myLinkedList=new MyLinkedList<>();
    public void push(E e){
        myLinkedList.addFirst(e);
    }
    public E pop(){
        int size=myLinkedList.size();
        if(size==0)
            throw new NoSuchElementException();
        E popVal=myLinkedList.removeFirst();
        return popVal;
    }
    public E peek(){
        int size=myLinkedList.size();
        if(size==0)
            throw new NoSuchElementException();
        E peekVal=myLinkedList.getFirst();
        return peekVal;
    }

    public void display(){
        int size=myLinkedList.size();
        if(size==0)
            throw new NoSuchElementException();
        myLinkedList.display();
    }

    public static void main(String[] args) {
        MyStack<Integer>myStack=new MyStack<>();
        myStack.push(12);
        myStack.push(13);
        myStack.push(21);
        myStack.push(-10);
        myStack.push(42);
        myStack.push(63);
        myStack.push(11);
        myStack.push(-29);
        myStack.display();
        System.out.println(myStack.pop());
        System.out.println(myStack.pop());
        System.out.println(myStack.pop());
        myStack.display();
        System.out.println(myStack.peek());

    }
}

队列封装

import java.util.NoSuchElementException;

public class MyQueue<E> {
    MyLinkedList<E>myLinkedList=new MyLinkedList<>();
    public void enqueue(E e){
        myLinkedList.addLast(e);
    }
    public E dequeue(){
        if(myLinkedList.size()==0)
            throw new NoSuchElementException();
        return myLinkedList.removeFirst();
    }
    public E peek(){
        if(myLinkedList.size()==0)
            throw new NoSuchElementException();
        return myLinkedList.getFirst();
    }
    public void display(){
        myLinkedList.display();
    }
    public static void main(String[] args) {
        MyQueue<Integer>myQueue=new MyQueue<>();
        myQueue.enqueue(32);
        myQueue.enqueue(18);
        myQueue.enqueue(41);
        myQueue.enqueue(22);
        myQueue.display();
        System.out.println(myQueue.dequeue());
        myQueue.display();
        System.out.println(myQueue.peek());
    }
}