From 75b6a8c7805801e2c4aefea62e4eefef3869d317 Mon Sep 17 00:00:00 2001 From: hades Date: Tue, 26 Oct 2021 15:38:40 +0800 Subject: [PATCH 1/2] test --- FitstExperiment/first.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/FitstExperiment/first.cpp b/FitstExperiment/first.cpp index 1bebb83..d5501d7 100644 --- a/FitstExperiment/first.cpp +++ b/FitstExperiment/first.cpp @@ -1,7 +1,7 @@ #include #include struct Node{//结点结构体起手 - int id ;//当前位置编号 + int id ; Node *next = NULL; }; From eaf57b0d40cd91badb960f867b2e6e9ef4b84b41 Mon Sep 17 00:00:00 2001 From: hades Date: Tue, 26 Oct 2021 16:46:41 +0800 Subject: [PATCH 2/2] test --- FitstExperiment/first.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/FitstExperiment/first.cpp b/FitstExperiment/first.cpp index d5501d7..d97b3f0 100644 --- a/FitstExperiment/first.cpp +++ b/FitstExperiment/first.cpp @@ -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 ;