约瑟夫环问题

最新推荐文章于 2022-04-06 10:30:21 发布

渡人既是渡己

最新推荐文章于 2022-04-06 10:30:21 发布

阅读量106

点赞数

分类专栏： JAVA 文章标签： java

本文链接：https://blog.csdn.net/kylin_tam/article/details/120731275

版权

JAVA 专栏收录该内容

42 篇文章 2 订阅

订阅专栏

public class 约瑟夫环 {



 public static int[] answer(int m, int n){


   Node head = new Node(1,null);
   Node temp = null;
   for (int i = 2; i <= m; i++) {
     temp = temp==null?head:temp;
     temp.next = new Node(i,null);
     temp=temp.next;
   }
   temp.next = head;
   Node p = head;
   while (p.next.next!=p){
   //这里报数不能报到n 想一想
     for (int i = 1; i < n-1; i++) {
       p = p.next;
     }
     p.next = p.next.next;

   }
   return new int[]{p.var,p.next.var};
 }


 @Data
 @AllArgsConstructor
  private static class Node {
   int var;
   Node next;

  }

  public static void main(String[] args) {
    System.out.println(Arrays.toString(answer(39,3)));
    System.out.println(Arrays.toString(answer(39,7)));
  }
}