【菜鸟学习--2】栈

import java.util.ArrayList;
import java.util.Scanner;


public class StackArray {
public static void main(String[] args)
{
	Scanner in=new Scanner(System.in);
	int act=0;
	stack s=new stack();
	while(true)
	{
		System.out.println("操作：");
		System.out.println("1 push");
		System.out.println("2 pop");
		System.out.println("3 quit");
		act=in.nextInt();
		if(act==1)
		{
			s.stackPush("stack push");
		}
		else if(act==2)
		{
			s.stackPop();
		}
		else
			break;
	}
}
}

class stack
{
	public static int MAX=5;
	ArrayList<String> sk=new ArrayList<String>();
	
	public boolean stackIsEmpty()
	{
		if(sk.size()==0)
			return true;
		else
			return false;
	}
	
	public boolean stackIsFull()
	{
		if(sk.size()==MAX)
			return true;
		else
			return false;
	}
	
	public void stackPush(String s)
	{
		if(this.stackIsFull())
			System.out.println("stack is full, can not push!");
		else
		{
			sk.add(s);
			System.out.println("success push!");
		}
	}
	
	public void stackPop()
	{
		if(this.stackIsEmpty())
			System.out.println("stack is empty, can not pop!");
		else
		{
			System.out.println("success pop"+sk.remove(sk.size()-1));
		}
	}
}