Code :
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 | <b>import java.util.Stack;/** * Created with IntelliJ IDEA. * User: aniket * Date: 11/15/13 * Time: 3:30 PM */public class InPlaceStackReversal { public static void reverse(Stack<String> stack){ String element = stack.pop(); if(stack.size() != 1) { reverse(stack); } pushToBottomOfStack(element,stack); } private static void pushToBottomOfStack(String data, Stack<String> stack){ String element = stack.pop(); if(stack.size() != 0){ pushToBottomOfStack(data, stack); } else { stack.push(data); } stack.push(element); } public static void main(String args[]) { Stack<String> myStack = new Stack<String>(); myStack.push("A"); myStack.push("B"); myStack.push("C"); myStack.push("D"); System.out.println("Original Stack : " + myStack); InPlaceStackReversal.reverse(myStack); System.out.println("Revered Stack : " + myStack); }}</b> |
Output :
Original Stack : [A, B, C, D]
Revered Stack : [D, C, B, A]
