用数组实现简单堆栈

堆栈：先进后出

队列：先进先出

package com.sxthomework;

public class MyStackDmeo<T> {
		int i=0;
		int j=10;
		MyStackDmeo(){}
		MyStackDmeo(int m){         //构造函数给数组定义空间
			this.j=m;
		}
		T []date=(T[])new Object[j];
		public void pull(T t) {     //进栈
			if(i==j-1) {
				System.out.println("这个数组已经满了");
			}
			date[j-i-1]=t;
			i++;
		}
		public T pop() {         //出栈
			T r=date[j-i-1+1];
			date[j-i]=null;
			i--;
			return r;
		}
		public void sop(Object obj) {
			System.out.println(obj.toString());
		}
		public static void main(String[] args) {
			MyStackDmeo<String> ms=	new MyStackDmeo<String >(10);
			ms.pull("张三");
			ms.pull("李四");
			System.out.println(ms.pop());
			System.out.println(ms.pop());
		}
	}