链栈代码实现:
public class myB {
public static class linkStack {
int data;
linkStack next;
}
private linkStack top;
public myB ( ) {
top = null ;
}
public void pushStack ( int n) {
Scanner scanner = new Scanner ( System. in ) ;
System. out. println ( "请输入压栈元素" ) ;
while ( n-- > 0 ) {
linkStack node = new linkStack ( ) ;
node. data = scanner. nextInt ( ) ;
node. next = top;
top = node;
}
System. out. println ( top. next) ;
}
public boolean popStack ( ) {
linkStack p;
if ( top== null ) {
return false ;
}
p= top;
top= top. next;
return true ;
}
public void linkStackPrint ( ) {
linkStack p = top;
while ( p != null ) {
System. out. println ( p. data) ;
p = p. next;
}
}
public static void main ( String[ ] args) {
System. out. println ( "请输入想要压栈元素个数" ) ;
Scanner scanner = new Scanner ( System. in ) ;
int n = scanner. nextInt ( ) ;
myB B = new myB ( ) ;
linkStack one = new linkStack ( ) ;
B . pushStack ( n) ;
B . linkStackPrint ( ) ;
B . popStack ( ) ;
B . linkStackPrint ( ) ;
}
}