链表实现栈

一、项目结构

在这里插入图片描述

二、链表

1、节点Node

public class Node {

    private int n;

    private Node next;


    public Node(int n) {
        this.n = n;
    }


    public int getN() {
        return n;
    }


    public void setN(int n) {
        this.n = n;
    }

    public Node getNext() {
        return next;
    }

    public void setNext(Node next) {
        this.next = next;
    }
}

2、链表

public class LinkedList {

    private Node bottom = null;


    /**
     * 添加元素
     * @param n
     */
    public void add(int n){

        if (bottom  == null){
            bottom = new Node(n);
            return;
        }

        Node temp = bottom;

        while (true){

            if (temp.getNext() == null){
                break;
            }

            temp = temp.getNext();

        }

        temp.setNext(new Node(n));
    }


    /**
     * 删除元素
     */
    public int delete(){

        if (bottom.getNext() == null){

            int value = bottom.getN();

            bottom = null;

            return value;
        }


        Node temp = bottom;

        while (true){

            if (temp.getNext().getNext() == null){
                break;
            }

            temp = temp.getNext();

        }

        int value = temp.getNext().getN();

        temp.setNext(null);

        return value;

    }


    /**
     * 获取第一个节点
     * @return
     */
    public Node getBottom() {
        return bottom;
    }


    /**
     * 链表有效值统计
     * @return
     */
    public int size(){

        Node temp = bottom;

        int size = 0;

        while (true){

            if (temp == null){
                break;
            }

            size++;

            temp = temp.getNext();

        }

        return size;
    }


    /**
     * 打印
     */
    public void print(){

        Node temp = bottom;

        int size = 0;

        while (true){

            if (temp == null){
                break;
            }

            System.out.println(temp.getN());

            temp = temp.getNext();

        }


    }

}

三、栈

public class LinkedListStack {


    private LinkedList linkedList;


    public LinkedListStack() {
        this.linkedList = new LinkedList();
    }


    /**
     * 判断栈是否为空
     * @return
     */
    public boolean isEmpty(){
        return linkedList.getBottom() == null;
    }


    /**
     * 入栈
     * @param n
     */
    public void push(int n){

      linkedList.add(n);

    }


    /**
     * 出栈
     * @return
     */
    public int pop(){

        if (isEmpty()){
            System.out.println("栈为空");
            return -1;
        }
        return linkedList.delete();
    }

    /**
     * 栈有效值
     * @return
     */
    public int size(){
        return linkedList.size();
    }


    /**
     * 打印栈
     */
    public void print(){

        linkedList.print();

    }

}

四、测试

1、测试类

public class Test {

    public static void main(String[] args) {

        LinkedListStack stack = new LinkedListStack();

        for (int i = 0; i < 10; i++) {
            stack.push(i);
        }

        stack.print();

        System.out.println("----------");

        for (int i = 0; i < 10; i++) {
            System.out.println(stack.pop());
        }

        System.out.println("-----------");


        stack.pop();

    }

}