public class Class_Stack {
private int Length;//定义的长度
private int S_top;//栈顶位置
private int[] stack ;//用数组表示
//初始化栈 ,只需要传入栈的长度
public Class_Stack(int length) {
super();
Length = length;
S_top =0;
stack = new int[Length];
}
//判断栈是否为满
public boolean isFull()
{
if(S_top==Length)
{
return true;
}
return false;
}
//判断栈是否为空
public boolean isEmpty()
{
if(S_top==0)
{
return true;
}
return false;
}
//入栈
public void S_push(int x)
{
if(!isFull())
{
stack[S_top] = x;
S_top++;
}else {
System.out.println("栈已满");
}
}
//出栈
public int S_pop()
{
int ele=-1;
if(!isEmpty())
{
ele=stack[S_top-1];
S_top--;
}
return ele;
}
//打印栈元素
public void S_print()
{
for(int i=0;i<S_top;i++)
{
System.out.println(stack[i]);
}
}
}