定义一组数组{4,3,2,1},定义逆置方法变成{1,2,3,4}

方法逆置：

package zhan;

public class SeqStack2 {
    private int[] srack=null;
    private int length;
    private  int top;
    public SeqStack2(){
        srack= new int [8];
        length=8;
        top=-1;
    }
    public SeqStack2(int size){
        srack=new int[size];
        length=size;
        top=-1;
    }
    public void push(int a){
    if(top==length-1){
        System.out.println("");
    }else{
        srack[++top]=a;
    }
}
public boolean isEmty(){
    return  top==-1;
}
public int pop(){
    if (this.isEmty()){
        System.out.println("栈满状态，元素不能入栈");
        return 1;
    }else {
        return  srack[top--];
    }
}
public  int peek(){
        if (this.isEmty()){
            System.out.println("栈空");
            return 111;
        }else{
            return  srack[top];
        }
}
}

测试类：

package zhan;

public class Demo {
    public static void main(String[] args) {
        SeqStack2 ss=new SeqStack2(4);
        ss.push(1);
        ss.push(2);
        ss.push(3);
        ss.push(4);
        //
        System.out.println("弹出栈的元素");
        System.out.println(  ss.pop()+",");
        System.out.println(  ss.pop()+",");
        System.out.println(  ss.pop()+",");
        System.out.println(  ss.pop()+",");
        System.out.println(  ss.pop());
        System.out.println("推出栈的元素");
        ss.push(4);
        System.out.println(  ss.peek()+",");
        ss.push(3);
        System.out.println(  ss.peek()+",");
        ss.push(2);
        System.out.println(  ss.peek()+",");
        ss.push(1);
        System.out.println(  ss.peek()+"\t");
        System.out.println("弹出的元素");
        System.out.println(  ss.pop()+"\t");
        System.out.println(  ss.pop()+"\t");
        System.out.println(  ss.pop()+"\t");
        System.out.println(  ss.pop()+"\t");
        
    }
}