algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-18 17:31:13 +08:00
Code Issues Packages Projects Releases Wiki Activity

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2020-10-24 10:23:28 +00:00
parent a23bac99e8
commit 5d59a2e828
219 changed files with 13758 additions and 14582 deletions
Download Patch File Download Diff File Expand all files Collapse all files

93
Others/ReverseStackUsingRecursion.java
View File

@ -2,66 +2,61 @@ package Others;
/* Program to reverse a Stack using Recursion*/
import java.util.Stack;
public class ReverseStackUsingRecursion {
//Stack
private static Stack<Integer> stack = new Stack<>();
//Main function
public static void main(String[] args) {
//To Create a Dummy Stack containing integers from 0-9
for (int i = 0; i < 10; i++) {
stack.push(i);
}
System.out.println("STACK");
//To print that dummy Stack
for (int k = 9; k >= 0; k--) {
System.out.println(k);
}
//Reverse Function called
reverseUsingRecursion(stack);
System.out.println("REVERSED STACK : ");
//To print reversed stack
while (!stack.isEmpty()) {
System.out.println(stack.pop());
}
// Stack
private static Stack<Integer> stack = new Stack<>();
// Main function
public static void main(String[] args) {
// To Create a Dummy Stack containing integers from 0-9
for (int i = 0; i < 10; i++) {
stack.push(i);
}
System.out.println("STACK");
// To print that dummy Stack
for (int k = 9; k >= 0; k--) {
System.out.println(k);
}
//Function Used to reverse Stack Using Recursion
private static void reverseUsingRecursion(Stack<Integer> stack) {
if (stack.isEmpty()) // If stack is empty then return
{
return;
}
/* All items are stored in call stack until we reach the end*/
// Reverse Function called
reverseUsingRecursion(stack);
int temptop = stack.peek();
stack.pop();
reverseUsingRecursion(stack); //Recursion call
insertAtEnd(temptop); // Insert items held in call stack one by one into stack
System.out.println("REVERSED STACK : ");
// To print reversed stack
while (!stack.isEmpty()) {
System.out.println(stack.pop());
}
}
//Function used to insert element at the end of stack
private static void insertAtEnd(int temptop) {
if (stack.isEmpty()) {
stack.push(temptop); // If stack is empty push the element
} else {
int temp = stack.peek(); /* All the items are stored in call stack until we reach end*/
stack.pop();
insertAtEnd(temptop); //Recursive call
stack.push(temp);
}
// Function Used to reverse Stack Using Recursion
private static void reverseUsingRecursion(Stack<Integer> stack) {
if (stack.isEmpty()) // If stack is empty then return
{
return;
}
/* All items are stored in call stack until we reach the end*/
int temptop = stack.peek();
stack.pop();
reverseUsingRecursion(stack); // Recursion call
insertAtEnd(temptop); // Insert items held in call stack one by one into stack
}
// Function used to insert element at the end of stack
private static void insertAtEnd(int temptop) {
if (stack.isEmpty()) {
stack.push(temptop); // If stack is empty push the element
} else {
int temp = stack.peek(); /* All the items are stored in call stack until we reach end*/
stack.pop();
insertAtEnd(temptop); // Recursive call
stack.push(temp);
}
}
}