数据结构（五）---栈的链式存储的实现---java版

------------------------------------------------链栈的节点设置--------------------------------------------------

package com.cn.hbut.domain;

//节点设置,适用于普通的单链表的节点设置，也适用于链栈的节点设置                    
public class Node {
Object data;
Node next;
//初始化一个数据域以及next域均为null的节点
public Node() {
this.data=null;
this.next=null;
}
//生成元素为obj，引用值为n的新节点
public Node(Object obj,Node n){
data=obj;
next=n;

}
public Object getData() {
return data;
}
public void setData(Object data) {
this.data = data;
}
public Node getNext() {
return next;
}
public void setNext(Node next) {
this.next = next;
}
@Override
public String toString() {
return "Node [data=" + data + ", next=" + next + "]";
}

}

-------------------------------------------------------链栈的具体实现类--------------------------------------

package com.cn.hbut.daoImpl;


import com.cn.hbut.dao.Stacks;
import com.cn.hbut.domain.Node;


/**
 * @author Administrator
 * description:链栈的及具体实现,top相当于单链表的head
 * 链栈是一种特殊的线性表，只能在栈顶操作
 */
public class LinkedSatck implements Stacks{
Node top;
int size=0;
//初始化一个栈，只有一个节点，next以及data均为null
public LinkedSatck() {
top=new Node();
}


@Override
public void clear() {
top=null;

}
//可以直接返回size
@Override
public int length() {
int j=0;
Node p =top;
while(p!=null){
p=p.getNext();
j++;

}
return j;
}


@Override
public boolean full() {
return false;
}


@Override
public boolean empty() {
return top==null;
}


@Override
public boolean pushs(Object e) {
Node p= new Node(e, top.getNext());
top.setNext(p);
size++;
return true;
}


@Override
public Object pops() {
top=top.getNext();
size--;
return top.getData();
}


@Override
public Object getTop() {
return top.getData();
}
//---------------------------------------------------测试链栈-----------------------------------------
public static void main(String[] args) {
LinkedSatck stack = new LinkedSatck();
stack.pushs(1);
stack.pushs(5);
stack.pushs(3);
System.out.println("当前栈的元素个数:"+stack.size);
System.out.println("当前出栈的元素:"+stack.pops());
System.out.println("当前栈的元素:"+stack.getTop());


}

}