利用顺序栈和逆序栈对随机排列的四个字母进行栈操作获得栈操作成功的结果并输出

Java利用顺序栈和逆序栈对随机排列的四个字母进行栈操作获得栈操作成功的结果并输出(数据结构）

*此文章禁止转载 侵权必究 *

代码如下：

import java.util.Stack;

public class CompareStack {

    public static void main(String[] args) {

        //正序排序
        Stack<String> random1Stack = ranStack();
        System.out.println("随机生成的栈:" + random1Stack);
        order(random1Stack);

        System.out.println("\n\n\n");

        //反序排序
        Stack<String> random2Stack = ranStack();
        System.out.println("随机生成的栈:" + random2Stack);
        trans(random2Stack);
    }

    static Stack ranStack() {
        Stack<String> randomStack = new Stack<>();
        for (int a = 0; a < 10; a++) {
            int i = (int) Math.round(Math.random() * 26);
            int j = (int) 'A' + i;
            char ch = (char) j;
            randomStack.push(String.valueOf(ch));
        }
        return randomStack;
    }

    static void order(Stack<String> stackMain) {
        System.out.println("栈顺序排序开始");
        Stack<String> stackAux = new Stack<>();
        while (!stackMain.empty()) {
            stackAux.push(stackMain.pop());
        }
        System.out.println("辅助栈=>" + stackAux + ",主栈=>" + stackMain);
        while (!stackAux.empty()) {
            String value = stackAux.pop();
            System.out.println("辅助栈[" + value + "]出栈;辅助栈=>" + stackAux);
            if (stackMain.empty())
                stackMain.push(value);
            else {
                // pop或者peek一个数之前一定要判断栈是否为空，否则会越界或者死循环
                while (!stackMain.empty() && stackMain.peek().compareTo(value) > 0) {
                    String pop = stackMain.pop();
                    stackAux.push(pop);
                    System.out.println("主栈[" + pop + "]出栈;主栈=>" + stackMain + ";辅助栈[" + pop + "]入栈;辅助栈=>" + stackAux);
                }
            }
            stackMain.push(value);
            System.out.println("主栈[" + value + "]入栈=>" + stackMain);
        }
        System.out.println("排序后结果=>" + stackMain);
    }

    static void trans(Stack<String> stackMain) {
        System.out.println("栈反序排序开始");
        Stack<String> stackAux = new Stack<>();
        while (!stackMain.empty()) {
            stackAux.push(stackMain.pop());
        }
        System.out.println("辅助栈=>" + stackAux + ",主栈=>" + stackMain);

        while (!stackAux.empty()) {
            String value = stackAux.pop();
            System.out.println("辅助栈[" + value + "]出栈;辅助栈=>" + stackAux);
            if (stackMain.empty())
                stackMain.push(value);
            else {
                // pop或者peek一个数之前一定要判断栈是否为空，否则会越界或者死循环
                while (!stackMain.empty() && value.compareTo(stackMain.peek()) > 0) {
                    String pop = stackMain.pop();
                    stackAux.push(pop);
                    System.out.println("主栈[" + pop + "]出栈;主栈=>" + stackMain + ";辅助栈[" + pop + "]入栈;辅助栈=>" + stackAux);
                }
            }
            stackMain.push(value);
            System.out.println("主栈[" + value + "]入栈=>" + stackMain);
        }
        System.out.println("排序后结果=>" + stackMain);
    }


}

运行效果图如下：


由此我们可以看到左右栈和主栈的相关操作了~