使用入栈出栈的方式来实现字符串反转

字符串反转

先进后出

import java.io.IOException;

/**
 * 字符串通过压栈出栈的方式实现字符串反转
 */
public class StringReverserThroughStack {

    public String input;
    private String output;

    public StringReverserThroughStack(String input) {
        this.input = input;
    }

    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);
            theStack.push(ch);
        }
        output = "";
        while (!theStack.isEmpty()) {
            // 获取后出的字符
            char ch = theStack.pop();
            // 拼接为字符串
            output = output + ch;
        }
        return output;
    }

    public static void main(String[] args) throws IOException {
        String input = "www.w3cschool.cc";
        String output;
        StringReverserThroughStack theReverser = new StringReverserThroughStack(input);
        output = theReverser.doRev();
        System.out.println("反转前： " + input);
        System.out.println("反转后： " + output);
    }

    class Stack {
        // 栈的大小
        private int maxSize;
        // 字符数组,用来存储字符串里的每一个字符
        private char[] stackArray;
        // 栈帧, 默认指向 -1 的位置
        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);
        }
    }
}