Java &引用；如何转换；伪码的纯文本算法

这是问题{}

我想将这些算法步骤转换为JAVA伪代码：

第一步-弹出堆栈顶部并将其推入堆栈（T）

第二步-将顶部存储在变量（v）中

第三步-弹出堆栈（T）中的所有元素，并再次将其推入堆栈（s）

第四步-堆栈中的推送变量（v）元素

重复这些步骤，直到将整个堆栈反转，但每次完成这些步骤并重复它们时，将第一步重复1。

---

这是我的堆栈图解决方案{}

这将帮助您解决问题

import java.util.*;

class Stack
{
    private int arr[];
    private int top;
    private int capacity;

    // Constructor to initialize stack
    Stack(int size)
    {
        arr = new int[size];
        capacity = size;
        top = -1;
    }

    // Utility function to add an element x in the stack
    public void push(int x)
    {
        if (isFull())
        {
            System.out.println("OverFlow\nProgram Terminated\n");
            System.exit(1);
        }

        System.out.println("Inserting " + x);
        arr[++top] = x;
    }

    // Utility function to pop top element from the stack
    public int pop()
    {
        // check for stack underflow
        if (isEmpty())
        {
            System.out.println("UnderFlow\nProgram Terminated");
            System.exit(1);
        }

        System.out.println("Removing " + peek());

        // decrease stack size by 1 and (optionally) return the popped element
        return arr[top--];
    }

    // Utility function to return top element in a stack
    public int peek()
    {
        if (!isEmpty())
            return arr[top];
        else
            System.exit(1);

        return -1;
    }

    // Utility function to return the size of the stack
    public int size()
    {
        return top + 1;
    }

    // Utility function to check if the stack is empty or not
    public Boolean isEmpty()
    {
        return top == -1;   // or return size() == 0;
    }

    // Utility function to check if the stack is full or not
    public Boolean isFull()
    {
        return top == capacity - 1; // or return size() == capacity;
    }

    public static void main (String[] args)
    {
        Stack stack = new Stack(3);

        stack.push(1);      // Inserting 1 in the stack
        stack.push(2);      // Inserting 2 in the stack

        stack.pop();        // removing the top 2
        stack.pop();        // removing the top 1

        stack.push(3);      // Inserting 3 in the stack

        System.out.println("Top element is: " + stack.peek());
        System.out.println("Stack size is " + stack.size());

        stack.pop();        // removing the top 3

        // check if stack is empty
        if (stack.isEmpty())
            System.out.println("Stack Is Empty");
        else
            System.out.println("Stack Is Not Empty");
    }
}