【算法】【JAVA】栈的实现

 

 

class Node{
    private int data;
    private Node previous;
    public Node(){}
    public int getData(){
        return data;
    }
    public void setData(int data){
        this.data=data;
    }
    public Node getPrevious(){
        return previous;
    }
    public void setPrevious(Node previous){
        this.previous=previous;
    }
}
class Stack1{
    private Node top;
    public Stack1(int data){
        top = new Node();
        top.setData(data);
        top.setPrevious(null);
    }
    
    public void push(int data){
        Node temp = new Node();
        temp.setData(data);
        temp.setPrevious(top);
        top = temp;
    }
    public int pop(){
        int popnum=0;
        popnum = top.getData();
        top=top.getPrevious();
        return popnum;
    }
    public boolean isempty(){
        if( top==null) return false;
        else return true;
    }
}
public class Stack {
    public static void main(String[] args){
        Stack1 s = new Stack1(0);
        for(int i=0;i<10;i++){
            s.push(i);
        }
        while(!s.isempty()){
            System.out.println(s.pop()+" ");
        }
    }

}