-
Notifications
You must be signed in to change notification settings - Fork 0
/
info22_8.c
93 lines (72 loc) · 1.46 KB
/
info22_8.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
// 筑波大学院過去入試問題平成22年8月
#include <stdio.h>
#include <stdlib.h>
struct list {
int data;
struct list *next;
};
struct list *head = NULL;
int sum_list();
void insert_list(int x);
void delete_list(int x);
int main() {
int a[10] = {3, 2, 5, 9, 1, 10, 8, 6, 7, 4};
int i;
struct list *p;
for (i = 0; i < 10; i++) {
insert_list(a[i]);
}
printf("<insert_list関数(昇順バージョン)>\n");
for (p = head; p != NULL; p = p->next) {
printf("%d\n", p->data);
}
printf("<sum_list関数>\n");
printf("%d\n", sum_list());
delete_list(3);
printf("<delete_list関数>\n");
for (p = head; p != NULL; p = p->next) {
printf("%d\n", p->data);
}
}
int sum_list() {
struct list *p;
int sum;
sum = 0;
p = head;
while (p != NULL) {
sum += p->data;
p = p->next;
}
return sum;
}
void insert_list(int x) {
struct list *p, *q, *t;
q = NULL;
for (p = head; p != NULL; p = p->next) {
if (p->data >= x) // ここの条件をif (p->data <= x)にすれば降順になる
break;
q = p;
}
t = (struct list *) malloc(sizeof(struct list));
t->data = x;
if (q == NULL)
head = t;
else
q->next = t;
t->next = p;
}
void delete_list(int x) {
struct list *p, *q;
q = NULL;
for (p =head; p != NULL; p = p->next) {
if (p->data == x) {
if (q == NULL)
head = p->next;
else
q->next = p->next;
free(p);
return;
}
q = p;
}
}