class Stacks
{
private int[] array;
/** from
N o w J a v a . c o m - 时 代 Java**/
private int tos;
private int size;
public Stacks()
{
size = 10;
array = new int[size];
tos = -1;
}
public Stacks(int size)
{
this.size = size;
array = new int[size];
tos = -1;
/*来自
NowJava.com - 时代Java*/
}
public void push(int value)
{
if(tos == size - 1)
System.out.println("Stack is full");
else
array[++tos] = value;
}
public void pop()
{
if(tos == -1)
System.out.println("Stack is empty");
else
--tos;
}
public void traverse()
{
int temp = tos - 1;
if(tos == -1)
System.out.println("Stack is empty");
else
{
System.out.println("Top of stack is : " + array[tos]);
if(temp > -1)
System.out.print("Other : ");
while(temp > -1)
System.out.print(array[temp--] + " ");
System.out.println();
}
}
public static void main(String[] args)
{
/**代码未完, 请加载全部代码(NowJava.com).**/
本文系作者在时代Java发表,未经许可,不得转载。如有侵权,请联系nowjava@qq.com删除。