java栈的实现
代码
1 import java.util.LinkedList;
2 public class LinkedListStack {
3 public static void main(String[] args){
4 myStack stack=new myStack();
5 for(int i=0;i<10;i++){
6 stack.push(i);
7 }
8 for(int j=0;j<10;j++){
9 stack.pop();
10 System.out.print(stack.top()+" ");
11 }
12 }
13 }
14
15 class myStack extends LinkedList{
16 public void push(Object v){
17 this.addLast(v);
18 }
19
20 public Object pop(){
21 return this.removeFirst();
22 }
23
24 public Object top(){
25 return this.getFirst();
26 }
27 }
import java.util.LinkedList;
public class LinkedListStack {
public static void main(String[] args){
myStack stack=new myStack();
for(int i=0;i<10;i++){
stack.push(i);
}
for(int j=0;j<10;j++){
stack.pop();
System.out.print(stack.top()+" ");
}
}
}
class myStack extends LinkedList{
public void push(Object v){
this.addLast(v);
}
public Object pop(){
return this.removeFirst();
}
public Object top(){
return this.getFirst();
}
