Java 中队列和递归

public class DataConversion {
    public static void main(String[] args) {
        Stack<Integer> stack = new Stack<>();
        int num = 24241;
        while (num > 0) {
            stack.push(num % 10);
            num = num / 10;
        }

        while (stack.size() > 0) {
            System.out.print(stack.pop());
        }

        System.out.println("--------------------------------");
        Deque<Integer> stack1 = new ArrayDeque<>();
        int number = 12;
        while (number > 0) {
            stack1.push(number % 8);
            number = number / 8;
        }

        while (stack1.size() > 0) {
            System.out.print(stack1.pop());
        }
    }
}

public class DataConversion {
    public static v