数据结构--栈

package ArraystackDemo;
import java.util.Scanner;
public class ArraystackDemo {

	public static void main(String[] args) {
		// test
		ArrayStack stack = new ArrayStack(4);
		String key = "";
		boolean loop = true;//是否退出菜单
		Scanner scanner = new Scanner(System.in);
		while(loop){
			System.out.println("show:显示栈");
			System.out.println("exit:退出程序");
			System.out.println("push:入栈");
			System.out.println("pop:出栈");
			System.out.println("请输入你的选择");
			key = scanner.next();
			switch(key){
			case"show":
				stack.list();
				break;
			case"push":
				System.out.println("请输入一个数");
				int value = scanner.nextInt();
				stack.push(value);
				break;
			case"pop":
				try{
					int res = stack.pop();
					System.out.printf("取出的数为%d",res);
				}catch(Exception e){
					System.out.println(e.getMessage());
				}
				break;
			case"exit":
				scanner.close();//关闭这个流
				loop = false;
				
				break;
			default:
				break;
			}
		}
System.out.println("退出程序");
	}

}
//定义一个ArrayStack的标准类
class ArrayStack{
	private int maxSize;//栈最大大小
	private int[] stack;//数据放在数组里
	private int top = -1;//top表示栈顶，初始化为-1
	//构造器
	public ArrayStack(int maxSize){
		this.maxSize = maxSize;
		stack = new int[this.maxSize];
	}
	//full
	public boolean isFull(){
		return top == maxSize -1;
	}
	//empty
	public boolean isEmpty(){
		return top == -1;
	}
	//push
	public void push(int value){
		if(isFull()){
			System.out.println("full");
            return ;
		}
		top++;
		stack[top] = value;
	}
	//pop--返回栈底数据
	public int pop(){
		if(isEmpty()){
			System.out.println("empty");
		}
		int value = stack[top];
		top--;
		return value;
	}
	//显示栈的情况--遍历栈--从栈顶
	public void list(){
		if(isEmpty()){
			System.out.println("empty");
			return ;
		}
		for(int i = top;i >= 0;i --){
			System.out.printf("stack[%d] = %d\n",i,stack[i] );
		}
	}
}