質問編集履歴
2
プログラムの変更
test
CHANGED
|
File without changes
|
test
CHANGED
|
@@ -107,12 +107,11 @@
|
|
|
107
107
|
free(d2);
|
|
108
108
|
}
|
|
109
109
|
|
|
110
|
-
|
|
111
110
|
int main(void) {
|
|
112
111
|
int i;
|
|
113
112
|
char buf[128];
|
|
114
113
|
dllist d1, d2, p;
|
|
115
|
-
|
|
114
|
+
|
|
116
115
|
d1 = (struct dlnode *)malloc(sizeof(struct dlnode));
|
|
117
116
|
d1->prev = NULL;
|
|
118
117
|
d1->next = NULL;
|
|
@@ -128,35 +127,32 @@
|
|
|
128
127
|
insert(d2, i);
|
|
129
128
|
}
|
|
130
129
|
print_dllist(d1);
|
|
131
|
-
print_dllist(d2);
|
|
130
|
+
print_dllist(d2);
|
|
132
|
-
|
|
131
|
+
|
|
133
|
-
p = d1;
|
|
132
|
+
p = d1;
|
|
134
133
|
do {
|
|
135
|
-
if(p->element % 2) {
|
|
134
|
+
if(p->element % 2) {
|
|
136
135
|
p = p->next;
|
|
137
136
|
delete(p->prev);
|
|
138
|
-
|
|
137
|
+
|
|
139
138
|
}
|
|
140
139
|
p = p->next;
|
|
141
|
-
}while(p!=d1||p->next!=d1)
|
|
140
|
+
}while(p!=d1||p->next!=d1);
|
|
142
141
|
|
|
143
|
-
p = d2;
|
|
142
|
+
p = d2;
|
|
144
143
|
do{
|
|
145
|
-
if(!(p->element % 2)){
|
|
144
|
+
if(!(p->element % 2)){
|
|
146
|
-
p = p->next;
|
|
145
|
+
p = p->next;
|
|
147
|
-
delete(p->prev);
|
|
146
|
+
delete(p->prev);
|
|
148
|
-
|
|
147
|
+
|
|
149
|
-
}
|
|
148
|
+
}
|
|
150
149
|
p = p->next;
|
|
151
|
-
}while(p!=d2||p->next!=d2)
|
|
150
|
+
}while(p!=d2||p->next!=d2);
|
|
152
151
|
|
|
153
|
-
print_dllist(d1);
|
|
152
|
+
print_dllist(d1);
|
|
154
153
|
print_dllist(d2);
|
|
155
154
|
|
|
156
|
-
append_dllist(d1, d2);
|
|
155
|
+
append_dllist(d1, d2);
|
|
157
|
-
|
|
156
|
+
print_dllist(d1);
|
|
158
157
|
return 0;
|
|
159
158
|
}
|
|
160
|
-
```
|
|
161
|
-
|
|
162
|
-
|
1
プログラムの訂正
test
CHANGED
|
File without changes
|
test
CHANGED
|
@@ -142,7 +142,7 @@
|
|
|
142
142
|
|
|
143
143
|
p = d2;
|
|
144
144
|
do{
|
|
145
|
-
if!(
|
|
145
|
+
if(!(p->element % 2)){
|
|
146
146
|
p = p->next;
|
|
147
147
|
delete(p->prev);
|
|
148
148
|
continue;
|