[Link] [Link].
*;
class Strange
{
int ele[]=new int[20];
int top,cap;
Strange(int c)
{
cap=c;
top=-1;
}
void push(int x)
{
if(top==cap)
[Link]("Stack is full");
else
ele[++top]=x;
}
int pop()
{
if(top== -1)
{
[Link]("Stack is [Link] 99999");
return 99999;
}
else
return(ele[top--]);
}
public static void main(String args[])
{
Strange obj=new Strange(3);
[Link](15);
[Link](24);
[Link](39);
[Link]([Link]());
[Link]([Link]());
[Link](22);
[Link]([Link]());
[Link]([Link]());
[Link]([Link]());
}
}
[Link] [Link].*;
class ArrayToStack
{
int m[],st[],cap,top;
ArrayToStack(int n)
{
cap = n;
top = -1;
m = new int[cap];
st = new int[cap];
}
void inputMarks()
{
Scanner ob=new Scanner([Link]);
[Link]("Input marks:");
for(int i = 0; i < cap; i++){
m[i] = [Link]();
pushMarks(m[i]);
}
for(int i = 0; i < cap; i++){
for(int j = 0; j < cap - 1 - i; j++){
if(m[j] > m[j + 1])
{
int temp = m[j];
m[j] = m[j + 1];
m[j + 1] = temp;
}
}
}
}
void pushMarks(int v)
{
if(top + 1 < cap)
st[++top] = v;
else
[Link]("not possible");
}
int popMarks()
{
if(top == -1)
return -999;
else
return st[top--];
}
void display()
{
for(int i = 0; i <= top; i++)
[Link](st[i] + "\t");
[Link]();
}
public static void main(String args[])
{
ArraytoStack obj=new ArraytoStack();
[Link]();
[Link]();
[Link]();
}
}
[Link] [Link].*;
class WordPile
{
char ch[];
int capacity,top;
WordPile(int cap)
{
capacity = cap;
if(capacity > 20)
capacity = 20;
top = -1;
ch = new char[capacity];
}
void pushChar(char v)
{
if(top + 1 < capacity)
ch[++top] = v;
else
[Link]("WordPile is full");
}
char popChar()
{
if(top == -1)
return;
else
return ch[top--];
}
public static void main(String args[])
{
WordPile obj=new WordPile();
[Link]();
[Link]();
}
}
[Link] [Link].*;
class Book
{
void tell()
{
if(point == -1)
[Link]("SHELF EMPTY");
else
[Link](name[point]);
}
public void add(String v)
{
if(point + 1 < max)
name[++point] = v;
else
[Link]("SHELF FULL");
}
}
[Link] [Link].*;
class Register
{
void push(String n)
{
if(top + 1 < cap)
stud[++top] = n;
else
[Link]("OVERFLOW");
}
String pop()
{
if(top == -1)
return "$$";
else
return stud[top--];
}
}