//用linkedList模拟栈结构
//demo1();
Stack s =new Stack();
s.in("a");
s.in("b");
s.in("c");//进栈
s.in("d");
while (s.isEmpty()) {
System.out.println(s.out());//判断是否为空 出栈
}
}
public static void demo1() {
LinkedList list =new LinkedList();
list.addLast("a");
list.addLast("b");
list.addLast("c");
list.addLast("d");
/*System.out.println(list.removeLast());
System.out.println(list.removeLast());
System.out.println(list.removeLast());
System.out.println(list.removeLast());*/
while (!list.isEmpty()) {
System.out.println(list.removeLast());
}
}
//demo1();
Stack s =new Stack();
s.in("a");
s.in("b");
s.in("c");//进栈
s.in("d");
while (s.isEmpty()) {
System.out.println(s.out());//判断是否为空 出栈
}
}
public static void demo1() {
LinkedList list =new LinkedList();
list.addLast("a");
list.addLast("b");
list.addLast("c");
list.addLast("d");
/*System.out.println(list.removeLast());
System.out.println(list.removeLast());
System.out.println(list.removeLast());
System.out.println(list.removeLast());*/
while (!list.isEmpty()) {
System.out.println(list.removeLast());
}
}