算法学习(9)-链表之链表栈

package com.tw.dst.link; /** * <p>链表学习(三)：链表栈</p> * @author tangw 2010-12-08 * */ public class LinkStack { private LinkList linkList; public LinkStack(){ linkList = new LinkList(); } //进栈 public void push(int id,double dd){ linkList.insertFirst(id, dd); } //出栈 public Link pop(){ return linkList.deleteFirst(); } //是否为空 public boolean isEmpty(){ return linkList.isEmpty(); } public void displayList(){ System.out.println("----link stack list===>"); linkList.displayList(); } /** * @param args */ public static void main(String[] args) { //栈原理:后进先出 LinkStack linkStack = new LinkStack(); //入栈 linkStack.push(2,2.09); linkStack.push(4,4.09); //输出 linkStack.displayList(); //出栈 linkStack.pop(); linkStack.displayList(); } }

转载于:https://www.cnblogs.com/tw5566/archive/2010/12/26/2247858.html