数据结构单链表头插尾插和删除练习

#include <stdio.h>
#include<stdlib.h>
typedef struct list {
int data;
struct list* next;
}list;
list* init() {
list* L = (list*)malloc(sizeof(list));
L->data = 0;
L->next = NULL;
return L;
}
void in(list* L, int data) {
list* S = (list*)malloc(sizeof(list));
S->data = data;
S->next = L->next;
L->next = S;
}
void showHead(list* L) {
int i = 0;
list* zj = L->next;
while (zj) {
printf(“第%d个数为：%d\n”, ++i, zj->data);
zj = zj->next;
L->data++;
}
}
void Tail(list* L,int data) {
list* tran = L;
for (int i = 0; i < L->data; i++)
tran = tran->next;
list* S = (list*)malloc(sizeof(list));
S->data = data;
S->next = NULL;//插在尾部尾部指向NULL和初始化类似
tran->next = S;
L->data++;
}
void showTail(list* L) {
int i = 0;
list* zj = L->next;
while (zj) {
printf(“第%d个数为：%d\n”, ++i, zj->data);
zj = zj->next;
L->data++;
}
}
void delet(list* L,int data) {
list* seedAddress=L;
list* seedNextAddress = L->next;
while (seedNextAddress) {
if (seedNextAddress->data == data)
seedAddress->next = seedNextAddress->next;
//这里不能用else
seedAddress = seedAddress->next;
seedNextAddress = seedNextAddress->next;
}

}
int main() {
list* L = init();
/printf_s(“头插法逆序输出：\n”);
in(L, 1);
in(L, 2);
in(L, 3);
in(L, 4);
in(L, 5);
showHead(L);/
printf_s(“尾插法正输出：\n”);
Tail(L, 6);
Tail(L, 7);
Tail(L, 8);
Tail(L, 9);
Tail(L, 10);
showTail(L);
printf_s("*************************\n");
delet(L, 6);
showTail(L);
}