Data Structure and Algorithms : Stack Program in Java

Program

public class stackpgm {
private int maxSize;
private long[] stackArray;
private int top;
public stackpgm(int s)

{
maxSize = s;

stackArray = new long[maxSize];
top = -1;

}

public void push(long j)

{
    if(!isFull())
    {
      stackArray[++top] = j;
    }

}
public long pop()
{
   
      return stackArray[top--];  
   
     
}

public long peek()

{
return stackArray[top];
}

public boolean isEmpty()

{
return (top == -1);
}

public boolean isFull()
{
return (top == maxSize-1);
}

public static void main(String[] args)
{
stackpgm theStack = new stackpgm(10);
theStack.push(1);
theStack.push(2);
theStack.push(3);
theStack.push(4);
System.out.println("Pop up values");
while( !theStack.isEmpty() )
{
long value = theStack.pop();
System.out.print(value+"\n");
}
}


}

Output