Java用接口实现栈

package com.ltl.test;
public interface Mystack {
	public boolean isEmpty();
	public boolean isFull();
	public boolean push(int value);
	public int pop();
	public void show();
}

package com.ltl.test;

public class Stack implements Mystack {
	private int maxSize;
	private int[] stack;
	private int top=-1;

	public Stack(int num) {
		maxSize=num;
		stack=new int[maxSize];
	}

	@Override
	public boolean isEmpty() {
		// TODO Auto-generated method stub
		return top==-1;
	}

	@Override
	public boolean isFull() {
		// TODO Auto-generated method stub
		return top==maxSize-1;
	}

	@Override
	public boolean push(int value) {
		// TODO Auto-generated method stub
		if(isFull()) {
			System.out.println("栈已满！！！");
			return false;
		}
		top++;
		stack[top]=value;
		return true;
	}

	@Override
	public int pop() {
		// TODO Auto-generated method stub
		if(isEmpty()) {
			System.out.println("栈空！！");
		}
		int value=stack[top];
		top--;
		return value;
	}

	@Override
	public void show() {
		// TODO Auto-generated method stub
		if(isEmpty()) {
			System.out.println("栈空，没有数据！！");
			return;
		}
		for (int i = top; i >= 0; i--) {
			System.out.printf("stack[%d]=%d\n",i,stack[i]);
		}
	}
}

package com.ltl.test;

import java.util.Scanner;

public class StackTest {
	private static Scanner scanner=new Scanner(System.in);
	static Stack stacks=new Stack(5);
	public static void main(String[] args) {
		homePage();
	}
	private static void homePage() {
		String tip=("1.入栈\n"
				+"2.出栈\n"
				+"3.显示\n"
				+"0.退出");
		System.out.println(tip);
		int input=scanner.nextInt();
		switch (input) {
		case 1:
			addPage();
			break;
		case 2:
			deletePage();
			break;
		case 3:
			showPage();
			break;
		case 0:
			exitPage();
			break;
		default:
			ErrorPage();
			break;
		}
	}
	private static void ErrorPage() {
		System.out.println("您的输入有误，请重新输入！");
		homePage();
	}
	private static void exitPage() {
		System.out.println("感谢使用，欢迎再来！");
		
	}
	private static void deletePage() {
		try {
			int pop = stacks.pop();
			System.out.println("出栈的值是：" + pop);
		} catch (Exception e) {
			// TODO: handle exception
			System.out.println(e.getMessage());
		}
		homePage();
	}
	private static void showPage() {
		stacks.show();
		System.out.println("显示成功！");
		homePage();
	}
	private static void addPage() {
		System.out.println("请输入要进栈的数据：");
		int val=scanner.nextInt();
		if(stacks.push(val)) {
			System.out.println("入栈成功！");
			homePage();
		}else {
			System.out.println("入栈失败！");
			homePage();
		}
	}
}