怎么通过栈逆序字符串

本篇内容介绍了"怎么通过栈逆序字符串"的有关知识，在实际案例的操作过程中，不少人都会遇到这样的困境，接下来就让小编带领大家学习一下如何处理这些情况吧！希望大家仔细阅读，能够学有所成！

package helloclean;public class StackX {    private int maxSize;    private char[] stackArray;    private int top;    public StackX(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);    }}

package helloclean;public class Revever {    private String input;    private String output;    public Revever(String in) {        this.input = in;    }    public String rev() {        int stackSize = input.length();        StackX stackX = new StackX(stackSize);        for(int j = 0; j < input.length(); j ++) {            char ch = input.charAt(j);            stackX.push(ch);        }        output = "";        while (!stackX.isEmpty()) {            char ch = stackX.pop();            output = output + ch;        }        return output;    }}

package helloclean;import java.util.Scanner;public class ReverseApp {    public static void main(String[] args) {        String output = "";        Scanner scanner = new Scanner(System.in);        while (true) {            System.out.println("input:");            String input = scanner.nextLine();            if(input.equals("q")) {                System.out.println("退出！");                break;            }            Revever revever = new Revever(input);            output = revever.rev();            System.out.println("逆序: " + output);        }    }}

"怎么通过栈逆序字符串"的内容就介绍到这里了，感谢大家的阅读。如果想了解更多行业相关的知识可以关注网站，小编将为大家输出更多高质量的实用文章！