用LinkedList模拟栈数据结构的集合并测试
模拟栈
import java.util.LinkedList;
public class MyStack {
LinkedList linkedList;
public MyStack(){
linkedList = new LinkedList();
}
public void addStack(Object obj){
linkedList.addFirst(obj);
}
public Object get(){
Object poll = linkedList.poll();
linkedList.addLast(poll);
return poll;
}
}
测试
public class Test {
public static void main(String[] args) {
MyStack mystack = new MyStack();
mystack.addStack(100);
mystack.addStack(200);
mystack.addStack(300);
mystack.addStack(400);
mystack.addStack(500);
for(int i = 0;i<5;i++) {
Object obj = mystack.get();
System.out.print(obj+" ");
}
}
}
输出:500 400 300 200 100 //先进后出