import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;
/*
* LinkedList模拟堆栈
*/
class stackList{
private LinkedList<String> stack;
public stackList()
{
stack=new LinkedList<String>();
}
public void push(String e)
{
stack.push(e);//stack.addFirst()
}
public String pop()
{
return stack.pop();//stack.removeFirst()
}
public boolean isEmpty()
{
return stack.isEmpty();
}
}
public class t12_7 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner input=new Scanner(System.in);
stackList stack=new stackList();
System.out.println("请输入数据(quit)结束");
while(true)
{
String str=input.next();
if(str.equals("quit"))
break;
stack.push(str);
}
System.out.println("先进后出的序列：");
while(!stack.isEmpty())
System.out.println(stack.pop());
}
}
请输入数据(quit)结束
a b c d e quit
先进后出的序列：
e
d
c
b
a
