源程序
typedef int Type;typedef int Status;struct Node{ Type value; struct Node *next;};Status init(struct Node **h);Status insert_head(struct Node *head, Type value);void print(struct Node *head);Status insert_tail(struct Node *head, Type value);int lenth(struct Node *head);Status insert_index(struct Node *head, Type value, int index);Status delete_index(struct Node *head, int index);Status delete_value(struct Node *head, Type value);Status update_index(struct Node *head, int index, Type value);void update_value(struct Node *head, Type old_value, Type new_value);Status query_index(struct Node *head, int index);void query_value(struct Node *head, Type value);int main(){ int ret = 0; int i; struct Node *head; ret = init(&head); printf(ret ? "initialize successfully\n" : "initialize failed\n"); for (i = 0; i < 10; i++) { insert_head(head, i); } print(head); for (i = 0; i < 10; i++) { insert_tail(head, i); } print(head); printf("%d\n", lenth(head)); insert_index(head, 99, 19); print(head); delete_index(head, 19); print(head); delete_value(head, 2); print(head); update_index(head, 3, -1); update_value(head, 6, 66); print(head); query_index(head, 3); query_value(head, 7); return 0;}Status init(struct Node **h){ struct Node *newnode = (struct Node *)malloc(sizeof(struct Node)); if (NULL == newnode) { return F; } newnode->value = 0; newnode->next = NULL; *h = newnode; return T;}Status insert_head(struct Node *head, Type value){ struct Node *newnode = (struct Node *)malloc(sizeof(struct Node)); if (NULL == newnode) { return F; } newnode->value = value; newnode->next = head->next; head->next = newnode; return T;}Status insert_tail(struct Node *head, Type value){ struct Node *newnode = (struct Node *)malloc(sizeof(struct Node)); if (NULL == newnode) { return F; } newnode->value = value; newnode->next = NULL; while (head->next != NULL) { head = head->next; } head->next = newnode; return T;}Status insert_index(struct Node *head, Type value, int index){ if (0 == index || index > lenth(head)) { printf("out of range\n"); return F; } struct Node *newnode = (struct Node *)malloc(sizeof(struct Node)); if (NULL == newnode) { return F; } int i; for (i = 0; i < index; i++) { head = head->next; } newnode->value = value; newnode->next = head->next; head->next = newnode; return T;}Status delete_index(struct Node *head, int index){ if (0 == index || index > lenth(head)) { printf("out of range\n"); return F; } int i; for (i = 0; i < index; i++) { head = head->next; } struct Node *tmp = head->next->next; free(head->next); head->next = tmp; return T;}Status delete_value(struct Node *head, Type value){ int i, len; len = lenth(head); for(i = 0; i < len; i++) {// printf("i = %d value = %d\n", i, head->next->value); if (head->next->value == value) { struct Node *tmp = head->next->next; free(head->next); head->next = tmp; } else { head = head->next; } } return T;}Status update_index(struct Node *head, int index, Type value){ if (index < 0 || index > lenth(head)) { printf("out of range\n"); return F; } int i; for (i = 0; i <= index; i++) { head = head->next; } head->value = value; return T;}void update_value(struct Node *head, Type old_value, Type new_value){ while (head->next != NULL) { if (head->next->value == old_value) { head->next->value = new_value; } head = head->next; }}Status query_index(struct Node *head, int index){ if (index < 0 || index > lenth(head)) { printf("out of range\n"); return F; } int i; for (i = 0; i <= index; i++) { head = head->next; } printf("index = %d value = %d\n", index, head->value); return T;}void query_value(struct Node *head, Type value){ int count = 0; int index = 0; while (head->next != NULL) { if (head->next->value == value) { count++; printf("find %d: %d\n", value, index); } head = head->next; index++; } if (0 == count) { printf("not found\n"); }}void print(struct Node *head){ while (NULL != head->next) { printf("%d ", head->next->value); head = head->next; } printf("\n");}int lenth(struct Node *head){ int count = 0; while (NULL != head->next) { count++; head = head->next; } return count;}
- 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
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
- 117
- 118
- 119
- 120
- 121
- 122
- 123
- 124
- 125
- 126
- 127
- 128
- 129
- 130
- 131
- 132
- 133
- 134
- 135
- 136
- 137
- 138
- 139
- 140
- 141
- 142
- 143
- 144
- 145
- 146
- 147
- 148
- 149
- 150
- 151
- 152
- 153
- 154
- 155
- 156
- 157
- 158
- 159
- 160
- 161
- 162
- 163
- 164
- 165
- 166
- 167
- 168
- 169
- 170
- 171
- 172
- 173
- 174
- 175
- 176
- 177
- 178
- 179
- 180
- 181
- 182
- 183
- 184
- 185
- 186
- 187
- 188
- 189
- 190
- 191
- 192
- 193
- 194
- 195
- 196
- 197
- 198
- 199
- 200
- 201
- 202
- 203
- 204
- 205
- 206
- 207
- 208
- 209
- 210
- 211
- 212
- 213
- 214
- 215
- 216
- 217
- 218
- 219
- 220
- 221
- 222
- 223
- 224
- 225
- 226
- 227
- 228
- 229
- 230
- 231
- 232
- 233
- 234
- 235
- 236
- 237
- 238
- 239
- 240
- 241
- 242
- 243
- 244
- 245
- 246
- 247
- 248
- 249
- 250
- 251
- 252
- 253
- 254
- 255
- 256
- 257
- 258
- 259
- 260
- 261
- 262
- 263
- 264
- 265
- 266
- 267
- 268
- 269
- 270
- 271
- 272
- 273
- 274
- 275
- 276
- 277
- 278
- 279
- 280
- 281
运行结果