题解 | 约瑟夫环

import java.util.Scanner;

class Node {
    int val;
    Node next;
    public Node(int val) {
        this.val = val;
    }
}

public class Main {
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        int m = scanner.nextInt();

        if (n == 1)
        {
            System.out.println(0);
            return;
        }

        Node head = new Node(0);
        Node prev = head;
        for (int i = 1; i < n; i++)
        {
            prev.next = new Node(i);
            prev = prev.next;
        }
        
        prev.next = head;
        for (int i = 0; i < k; i++)
        {
            head = head.next;
        }

        while (head.next != head)
        {
            Node temp = head;
            for (int i = 0; i < m - 2; i++)
            {
                temp = temp.next;
            }
            temp.next = temp.next.next;
            head = temp.next;
        }
        System.out.println(head.val);
    }
}