顺序栈(java)

主要思想:
数组实现,先进后出,后进先出

public class stack1 {
	private int []items;//数组
	private int count;//栈的元素个数
	private int n;//栈的大小
	public stack1(int n) {
		items = new int[n];
		count = 0;
		this.n=n;
		
	}
	//入栈
	public  boolean push(int m) {
		if(count==n) {
			return false;
		}
		items[count]=m;
		count++;
		return true;
		
	}
	//出栈
	public int pop() {
		if(count==0) {
			return -1;
		}
		
		int item = items[count-1];
		count--;
		return item;
		
		
	}
	//遍历
	public void traverse() {
		for(int i=0;i<count;i++) {
			System.out.print(items[i]+" ");
		}
		System.out.println();
	}
	public static void main(String []args) {
		stack1 stack1 = new stack1(3);
		stack1.push(1);
		stack1.push(2);
		stack1.push(3);
		stack1.traverse();
		
		stack1.pop();
		stack1.traverse();
		
		
	}

}