java 链表实现栈

版权声明：嘿嘿嘿 https://blog.csdn.net/luzhensmart/article/details/87870722

思想是：

 

入栈的顺序是：1 2 3 4 5 那么保证出栈的顺序是5 4 3 2 1，以此类推 让head节点 指向栈顶节点 保证让其 倒序输出

public class MyStack<T> {

    private T data;

    private MyStack<T> next;


    public MyStack(T data, MyStack<T> next) {
        this.data = data;
        this.next = next;
    }

    public T getData() {
        return data;
    }

    public void setData(T data) {
        this.data = data;
    }

    public MyStack<T> getNext() {
        return next;
    }

    public void setNext(MyStack<T> next) {
        this.next = next;
    }
}

public class LinkStack<N> {

    private MyStack<N> head;

    private MyStack<N> tail;

    private Integer size=0;

    public MyStack<N> getHead() {
        return head;
    }

    public void setHead(MyStack<N> head) {
        this.head = head;
    }

    public MyStack<N> getTail() {
        return tail;
    }

    public void setTail(MyStack<N> tail) {
        this.tail = tail;
    }

    public Integer getSize() {
        return size;
    }

    public void setSize(Integer size) {
        this.size = size;
    }

    public void addStack(N data){
        MyStack<N> node = new MyStack<>(data,null);
        if(headIsNull()){
            head = node;
            tail = node;
            size++;
        }else{
            //新加入的node是:(data,null) 让这个新的node的next指向初始的head节点 head变为(data,head))
            node.setNext(head);
            head = node;

            size++;
        }
    }

    public N outStack(){
        if(size>0){
            N outData = head.getData();
            head = head.getNext();
            return outData;
        }else{
            throw new RuntimeException("栈里无元素!");
        }
    }

    public boolean headIsNull(){
        if(head == null){
            return true;
        }
        return false;
    }
}

public class Aa1 {
    public static void main(String[] args) {
        LinkStack<Integer> linkStack = new LinkStack<>();
        linkStack.addStack(1);
        linkStack.addStack(2);
        linkStack.addStack(3);
        linkStack.addStack(4);
        linkStack.addStack(5);

        for(int i=0;i<linkStack.getSize();i++){
            System.out.println(linkStack.outStack());
        }
    }
}

输出结果：