作 业

#include <stdio.h>
#include <malloc.h
typedef struct LinkNode{
char data;
struct LinkNode *next;
} LNode, *LinkList, *NodePtr;
LinkList initLinkList(){
NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));//分配空间
tempHeader->data = '\0';
tempHeader->next = NULL;
return tempHeader;
}

//打印数据
void printList(NodePtr paraHeader){
NodePtr p = paraHeader->next;//指向首元结点
while (p != NULL) {
printf("%c", p->data);
p = p->next;
}
}

//打印数据和地址
void printListMemory(NodePtr paraHeader){
NodePtr p = paraHeader;
while (p != NULL) {
printf("At address %ld, data = %c, next = %ld \r\n", p, p->data, p->next);
p = p->next;
}// Of while
printf("\r\n");
}

//尾插法
void appendElement(NodePtr paraHeader, char paraChar){
NodePtr p, q;

// 创建节点
q = (NodePtr)malloc(sizeof(LNode));
q->data = paraChar;
q->next = NULL;

// 查询尾节点
p = paraHeader;
while (p->next != NULL) {
p = p->next;
}

// 添加尾节点
p->next = q;
}

//插入新元素
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition){
NodePtr p, q;

// 查询位置
p = paraHeader;
for (int i = 0; i < paraPosition; i ++) {
p = p->next;
if (p == NULL) {
printf("The position %d is beyond the scope of the list.", paraPosition);
return;
}

// 创建新节点
q = (NodePtr)malloc(sizeof(LNode));
q->data = paraChar
printf("linking\r\n");//反馈当前程序正在进行链接的状态
q->next = p->next;
p->next = q;
}

//删除
void deleteElement(NodePtr paraHeader, char paraChar){
NodePtr p, q;
p = paraHeader;

//查找前驱
while ((p->next != NULL) && (p->next->data != paraChar)){
p = p->next;
}

//没有的情况

if (p->next == NULL) {
printf("Cannot delete %c\r\n", paraChar);
return;
}

q = p->next;//保存目标地址
p->next = p->next->next;
free(q);//释放空间
}