链表-实现栈和队列

栈的实现

class ListNode {
    int val;
    ListNode next;
    ListNode() {}
    ListNode(int val) { this.val = val; }
    ListNode(int val, ListNode next) { this.val = val; this.next = next; }
}

class Stack {

    //定义一个链表
    ListNode head = new ListNode();
    //链表的大小/栈的容量
    int count = 0;


    //构造方法
    public Stack() {
    }

    //入栈
    public void push(int item){
        ListNode newNode = new ListNode(item);
        newNode.next = head.next;
        head = newNode;
        count++;
    }

    //出栈
    public int pop(){
        if (count<=0){
            throw new RuntimeException("stack is empty");
        }
        ListNode p = head;
        head = head.next;
        count--;
        return p.val;
    }

    //栈是否为空
    public Boolean isEmpty(){
        if(count<=0){
            return true;
        }
        return false;
    }
}

队列的实现

class ListNode {
    int val;
    ListNode next;
    ListNode() {}
    ListNode(int val) { this.val = val; }
    ListNode(int val, ListNode next) { this.val = val; this.next = next; }
}

class Queue{

    //定义一个链表,头
    ListNode head = new ListNode();
    ListNode tail = head;
    //链表的大小/栈的容量
    int count = 0;

    public Queue() {

    }

    //入队
    public void queue(int item){
        ListNode newNode = new ListNode(item);
        tail.next = newNode;
        tail = newNode;
    }

    //出队
    public int dequeue(){
        ListNode p = head;
        head = head.next;
        return p.val;
    }
}