test

FitstExperiment/first.cpp

@@ -1,7 +1,7 @@
 #include<stdio.h>
 #include<stdlib.h>
 struct Node{//结点结构体起手
-    int id ;//当前位置编号
+    int id ;
     Node *next = NULL;
 };
 
@@ -15,7 +15,7 @@ bool cut_next(Node *now,int move);
 void Josephus(int n,int m,Node *head);
 void special_Josephus(int n,Node *head);
 
-Node * creat_and_prepare(int n){ //循环链表创建函数,并且每个结点的id为n-1
+Node * creat_and_prepare(int n){
     Node *head , *current;
     head = (Node*)malloc(sizeof(Node));
     current = head ;