#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;
}// Of while
printf("\r\n");
}
/***
增添
***/
void appendElement(NodePtr paraHeader, char paraChar){
NodePtr p, q;
// Step 1 为新链表开空间
q = (NodePtr)malloc(sizeof(LNode));
q->data = paraChar;
q->next = NULL;
// Step 2 找到最后一个节点
p = paraHeader;
while (p->next != NULL) {
p = p->next;
}
// Step 3 接上
p->next = q;
}
/***
插入指定位置
***/
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition){
NodePtr p, q;
// Step 1 找位置
p = paraHeader;
int i;
for (i = 0; i < paraPosition; i ++) {
p = p->next;
if (p == NULL) {
printf("The position %d is beyond the scope of the list.", paraPosition);
return;
}
}
// Step 2 开空间
q = (NodePtr)malloc(sizeof(LNode));
q->data = paraChar;
// Step 3 接上
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);
}
void appendInsertDeleteTest(){
// Step 1 建头
LinkList tempList = initLinkList();
printList(tempList);
// Step 2 添加
appendElement(tempList, 'H');
appendElement(tempList, 'e');
appendElement(tempList, 'l');
appendElement(tempList, 'l');
appendElement(tempList, 'o');
appendElement(tempList, '!');
printList(tempList);
// Step 3 删除
deleteElement(tempList, 'e');
deleteElement(tempList, 'a');
deleteElement(tempList, 'o');
printList(tempList);
// Step 4 插入
insertElement(tempList, 'o', 1);
printList(tempList);
}
void basicAddressTest(){
LNode tempNode1, tempNode2;
tempNode1.data = 4;
tempNode1.next = NULL;
tempNode2.data = 6;
tempNode2.next = NULL;
printf("The first node: %d, %d, %d\r\n",
&tempNode1, &tempNode1.data, &tempNode1.next);
printf("The second node: %d, %d, %d\r\n",
&tempNode2, &tempNode2.data, &tempNode2.next);
tempNode1.next = &tempNode2;
}
int main(){
appendInsertDeleteTest();
}
在脑海中想象一下图形会好理解一些