题解 | 约瑟夫环

import java.awt.List;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt();
            int k = in.nextInt();
            int m = in.nextInt();
            int[] str = new int[n];
            
           
            getValue(str,k,m,n);
            for(int i = 0;i<n;i++){
                if(str[i] == 0){
                    System.out.println(i);
                }
            }

            
        }
    }


    public static void getValue( int[] a ,int k,int m,int n){
         int count = 0; 
         int remain = n;
         boolean jishu = false;
         int index = -1;
         while (true){
             index++;
            if(!jishu && index == k){
                jishu = true;
            }
           
            if(index >= a.length){
                index = 0;
            }
            if(jishu && a[index]==0){
                count++;
            }
            if(count == m){
                a[index] = -1;
                count = 0;
                remain --;
                // System.out.println("11:"+Arrays.toString(a)+",index:"+index);
            }
            
            if(remain == 1 ){
              break;
            }
         }

        }
        
    
}