先进后出:
package org.luzhen.test.bean;
import java.util.LinkedList;
public class MainClass {
public static void main(String[] args) {
StackL stack = new StackL();
for (int i = 0; i < 10; i++) {
stack.push(i);
}
while (!stack.empty()) {
System.out.println(stack.pop());
}
}
}
class StackL {
private LinkedList list = new LinkedList();
public void push(Object v) {
//放入链表前面 作为首元素 放入的顺序 首元素依次后移 也就是5,4,3,2,1的顺序 最后9作为首元素
list.addFirst(v);
}
public Object top() {
return list.getFirst();
}
public Object pop() {
//移除首元素
return list.removeFirst();
}
public boolean empty(){
return list.isEmpty();
}
}
输出结果:
9
8
7
6
5
4
3
2
1
0
Process finished with exit code 0