回答編集履歴
3
変更
answer
CHANGED
@@ -22,12 +22,13 @@
|
|
22
22
|
}
|
23
23
|
|
24
24
|
struct student *dequeue(struct student *p){
|
25
|
-
|
25
|
+
|
26
26
|
if(p == NULL)
|
27
27
|
return NULL;
|
28
28
|
printf("Number=%d Name=%s\n",p->num, p->name);
|
29
|
-
|
30
|
-
|
29
|
+
struct student *q = p->next;
|
30
|
+
free(p);
|
31
|
+
return q;
|
31
32
|
}
|
32
33
|
|
33
34
|
void print_remain(struct student *p){
|
2
変更
answer
CHANGED
@@ -22,11 +22,12 @@
|
|
22
22
|
}
|
23
23
|
|
24
24
|
struct student *dequeue(struct student *p){
|
25
|
+
struct student *q = p;
|
25
26
|
if(p == NULL)
|
26
27
|
return NULL;
|
27
28
|
printf("Number=%d Name=%s\n",p->num, p->name);
|
28
|
-
|
29
|
+
|
29
|
-
return
|
30
|
+
return q->next;
|
30
31
|
}
|
31
32
|
|
32
33
|
void print_remain(struct student *p){
|
1
修正
answer
CHANGED
@@ -25,8 +25,8 @@
|
|
25
25
|
if(p == NULL)
|
26
26
|
return NULL;
|
27
27
|
printf("Number=%d Name=%s\n",p->num, p->name);
|
28
|
+
free(p);
|
28
29
|
return p->next;
|
29
|
-
free(p);
|
30
30
|
}
|
31
31
|
|
32
32
|
void print_remain(struct student *p){
|