String Reverser Through Stack : Stack « Collections Data Structure « Java

String Reverser Through Stack

String Reverser Through Stack

public class StringReverserThroughStack {
  private String input; 

  private String output;

  public StringReverserThroughStack(String in) {
    input = in;

  public String doRev() {
    int stackSize = input.length(); 
    Stack theStack = new Stack(stackSize); 

    for (int i = 0; i < input.length(); i++) {
      char ch = input.charAt(i); 
    output = "";
    while (!theStack.isEmpty()) {
      char ch = theStack.pop(); 
      output = output + ch; 
    return output;

  public static void main(String[] args) throws IOException {
    String input = "Java Source and Support";
    String output;
    StringReverserThroughStack theReverser = new StringReverserThroughStack(input);
    output = theReverser.doRev();
    System.out.println("Reversed: " + output);
  class Stack {
    private int maxSize;
    private char[] stackArray;
    private int top;
    public Stack(int max) {
      maxSize = max;
      stackArray = new char[maxSize];
      top = -1;
    public void push(char j) {
      stackArray[++top] = j;
    public char pop() {
      return stackArray[top--];
    public char peek() {
      return stackArray[top];
    public boolean isEmpty() {
      return (top == -1);


Related examples in the same category

1.Demonstration of Stack ClassDemonstration of Stack Class
2.Stack in java.utilStack in java.util
3.Stack data structureStack data structure
4.Bracket Checker
5.Link stackLink stack
6.Triangular numbersTriangular numbers
7.Triangular numbers with stack replaces recursionTriangular numbers with stack replaces recursion
8.Show String ReversalsShow String Reversals
9.Generic stack demo with annotation
10.Character Stack
11.A faster, smaller stack implementation.
12.Growable Object stack with type specific access methods
13.Growable int stack with type specific access methods
14.Stack for boolean values
15.extends ArrayList to create Stack
16.Growable String stack with type specific access methods.
17.A simple integer based stack.
18.A very simple unsynchronized stack. This one is faster than the java.util-Version.
19.Pop an empty stack ntry times and catch the resulting exceptionPop an empty stack ntry times and catch the resulting exception
20.Object Stack
21.Fast stack