栈原理的代码实现（JAVA、数组方式）

package link;

import java.util.Arrays;

public class MyStack<T> {
    Object[] arr=new Object[10];
    int top=0;

    public void push(Object obj){
        if (top==arr.length){
            arr= Arrays.copyOf(arr,arr.length+1);
        }
        //arr[top++]=obj;
        arr[top]=obj;
        top++;
    }

    public T pop(){
        /*arr[top-1]=null;
        //arr= Arrays.copyOf(arr,arr.length-1);
        top--;*/
        return (T) arr[--top];
    }

    public int size(){
        return top;
    }


    public String toString(){
        StringBuilder sb=new StringBuilder("[");
        for (int i = 0; i < top; i++) {
            sb.append(arr[i]+",");
        }
        sb.deleteCharAt(sb.length()-1);
        sb.append("]");
        return sb.toString();
    }
}