Java数据结构队列倒序输出

设计一个算法，利用一个整数栈将一个整数队列中的所有元素倒过来，队头变队尾，队尾变队头。

import java.util.LinkedList;

public class MyQueue {
    LinkedList linkedList = new LinkedList();
    public void put(Object o){
        linkedList.addLast(o);
    }
    public Object get(){
        if(!linkedList.isEmpty())
            return linkedList.removeFirst();
        return "";
    }
    public boolean isEmpty(){
        return linkedList.isEmpty();
    }
}

import java.util.LinkedList;
public class MyStack {
    LinkedList linkList = new LinkedList<Object>();
    public void push(Object object) {
        linkList.addFirst(object);
    }
    public boolean isEmpty() {
        return linkList.isEmpty();
    }
    public Object pop() {
        if (!linkList.isEmpty())
            return linkList.removeFirst();
        return "栈内无元素";
    }
}

public class test{
    public static void main(String[] args) {
        MyStack ms = new MyStack();
        MyQueue mq = new MyQueue();
        mq.put(1);
        mq.put(2);
        mq.put(3);
        while(!mq.isEmpty()){
            ms.push(mq.get());
        }
        while(!ms.isEmpty()){
            mq.put(ms.pop());
        }
        while(!mq.isEmpty()){
            System.out.print(mq.get());
        }
    }
}