1. To Push the elements
2. To POP the element
3. To display the elements on the stack.
This is no complex code. What we need to remember is that we should initialize TOS as -1 initially. Most beginner users could face error on the 6th and 11th line of code. Here at first we first create a reference variable at line 6 and create required length array in line 11.
If we use int aarray = new int[MaxSize]; in the class, it will create a zero-length array. as int MaxSize; means int MaxSize = 0;
Other are really simple algorithms. we need to check if Stack is full while pushing and need to check if stack is empty while using pop.
We need to increment TOS everytime we push a element and decrement whenever we pop a element.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 | import java.util.Scanner;
class Stack
{
int TOS = -1;
int MaxSize;
int aarray[];
Stack(int Max1Size)
{
this.MaxSize = MaxSize;
this.aarray = new int[MaxSize];
}
void push(int a)
{
if(TOS == MaxSize - 1)
{
System.out.println("Stack is Full");
}
else
{
TOS += 1;
aarray[TOS] = a;
System.out.println(a +" is inserted in the Stack");
}
return;
}
void pop()
{
if (TOS == -1)
{
System.out.println("Stack is Empty.");
}
else
{
int item = aarray[TOS];
TOS -= 1;
System.out.println(item +" is poped Out from the Stack");
}
return;
}
void display()
{
if (TOS == -1)
{
System.out.println("Stack is Empty.");
}
else
{
System.out.println("Elements in Stack are:- ");
for(int i = TOS; i >= 0; i--)
{
System.out.println(aarray[i]);
}
}
return;
}
}
public class StackTest
{
public static void main(String args[])
{
Scanner input = new Scanner(System.in);
System.out.println("Enter Maximum size of array");
int MaxSize = input.nextInt();
Stack astack = new Stack(MaxSize);
int next = 0;
while( next == 0)
{
System.out.println("\nOption:- \t To Do\n1 \t Push to stack. \n2 \t Pop from stack\n3 \t Display stack \n4 \t Exit the program");
int select = input.nextInt();
switch(select)
{
case 1:
{
System.out.println("Enter the element to push in the stack");
int element = input.nextInt();
astack.push(element);
break;
}
case 2:
{
astack.pop();
break;
}
case 3:
{
astack.display();
break;
}
case 4:
{
next = 1;
System.out.println("Thank You! :)");
break;
}
default:
{
System.out.println("Please Enter a valid OPtion.");
break;
}
}
}
}
}
|
This one of the code I had written at college in practical of DSA. Thank you :)
0 comments:
Post a Comment