implement stack by one queue

class  {

    
    Queue<Integer> queue;
    public () {
        queue = new LinkedList<>();

    }

    /** Push element x onto stack. */
    public void push(int x) {
        queue.offer(x);
    }

    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
        int size = queue.size();
        if (size == 0) {
            return -1;
        }
        moveItem(size);
        int res = queue.poll();
        return res;

    }
    private void moveItem(int size) {
        int count = 0;
        while (count < size - 1) {
            queue.offer(queue.poll());
            count++;
        }
    }

    /** Get the top element. */
    public int top() {
        int size = queue.size();
        moveItem(size);
        int res = queue.poll();
        queue.offer(res);
        return res;

    }

    /** Returns whether the stack is empty. */
    public boolean empty() {
        return queue.isEmpty();
    }
}