java数据结构和算法------栈

package iYou.neugle.list;

public class MySeqStack<T> {
    private Stack stack = new Stack();

    class Stack {
        public int maxSize = 10;
        public T[] data = (T[]) new Object[maxSize];
        public int top = -1;// 栈顶指针
    }

    // 初始化栈
    public void SeqStackInit() {
        this.stack.top = -1;
        System.out.println("栈初始化成功!");
    }

    // 入栈
    public void SeqStackPush(T data) {
        if (this.stack.top == this.stack.maxSize - 1) {
            System.out.println("栈中内容已满!");
            return;
        }
        this.stack.data[++this.stack.top] = data;
    }

    // 出栈
    public T SeqStackPop() {
        if (this.stack.top == -1) {
            System.out.println("栈中内容已空!");
        }
        T data = this.stack.data[stack.top];
        this.stack.data[this.stack.top] = null;
        this.stack.top--;
        return data;
    }

    // 获取栈顶元素
    public T SeqStackPeek() {
        if (this.stack.top == -1) {
            System.out.println("栈中内容已空!");
            return null;
        }
        return this.stack.data[this.stack.top];
    }
}