约瑟夫环问题

最新推荐文章于 2025-09-06 09:33:29 发布

转载最新推荐文章于 2025-09-06 09:33:29 发布 · 47 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/sumbud/p/4869407.html

文章标签：

#java

/*
 *约瑟夫环问题
 * 抱1 2 3
 */
import java.util.*;
public class Yuan{

    public static void main(String[] args) throws Exception{
        Scanner input = new Scanner(System.in);
        int p = input.nextInt();
        System.out.println(leftPerson(p));
    }
    public static int leftPerson(int n) throws Exception {
        boolean[] per = new boolean[n];
        for (int i = 0; i < per.length; i++) {
            per[i] = true;
        }
        int t = 0, len = per.length;
        while (len > 1) {
            for (int i = 0; i < per.length; i++) {

                if (per[i]) {
                    t++;
                    if (t == 3) {
                        t = 0;
                        per[i] = false;
                        len--;
                    }
                }
            }
        }
        int a = 0;
        for(int j = 0;j<per.length;j++){
            if(per[j]=true){
                a = j;
            }
        }
        return a;
    }
}