1823. Find the Winner of the Circular Game

class Solution {
    public int findTheWinner(int n, int k) {
        Queue<Integer> queue = new LinkedList<Integer>();
        for(int i=1; i<=n; i++){
            queue.offer(i);
        }
        while(queue.size()>1){
            int remove = k;
            while(remove>1){
                queue.offer(queue.remove());
                remove--;
            }
            queue.remove();
        }
        return queue.peek();
    }
}