professer's code:
#include <stdio.h>
#include <malloc.h>
/**
* Linked list of characters. The key is data.
*/
typedef struct LinkNode{
char data;
struct LinkNode *next;
} LNode, *LinkList, *NodePtr;
/**
* Initialize the list with a header.
* @return The pointer to the header.
*/
LinkList initLinkList(){
NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
tempHeader->data = '\0';
tempHeader->next = NULL;
return tempHeader;
}// Of initLinkList
/**
* Print the list.
* @param paraHeader The header of the list.
*/
void printList(NodePtr paraHeader){
NodePtr p = paraHeader->next;
while (p != NULL) {
printf("%c", p->data);
p = p->next;
}// Of while
printf("\r\n");
}// Of printList
/**
* Add an element to the tail.
* @param paraHeader The header of the list.
* @param paraChar The given char.
*/
void appendElement(NodePtr paraHeader, char paraChar){
NodePtr p, q;
// Step 1. Construct a new node.
q = (NodePtr)malloc(sizeof(LNode));
q->data = paraChar;
q->next = NULL;
// Step 2. Search to the tail.
p = paraHeader;
while (p->next != NULL) {
p = p->next;
}// Of while
// Step 3. Now add/link.
p->next = q;
}// Of appendElement
/**
* Insert an element to the given position.
* @param paraHeader The header of the list.
* @param paraChar The given char.
* @param paraPosition The given position.
*/
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition){
NodePtr p, q;
// Step 1. Search to the position.
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;
}// Of if
} // Of for i
// Step 2. Construct a new node.
q = (NodePtr)malloc(sizeof(LNode));
q->data = paraChar;
// Step 3. Now link.
printf("linking\r\n");
q->next = p->next;
p->next = q;
}// Of insertElement
/**
* Delete an element from the list.
* @param paraHeader The header of the list.
* @param paraChar The given char.
*/
void deleteElement(NodePtr paraHeader, char paraChar){
NodePtr p, q;
p = paraHeader;
while ((p->next != NULL) && (p->next->data != paraChar)){
p = p->next;
}// Of while
if (p->next == NULL) {
printf("Cannot delete %c\r\n", paraChar);
return;
}// Of if
q = p->next;
p->next = p->next->next;
free(q);
}// Of deleteElement
/**
* Unit test.
*/
void appendInsertDeleteTest(){
// Step 1. Initialize an empty list.
LinkList tempList = initLinkList();
printList(tempList);
// Step 2. Add some characters.
appendElement(tempList, 'H');
appendElement(tempList, 'e');
appendElement(tempList, 'l');
appendElement(tempList, 'l');
appendElement(tempList, 'o');
appendElement(tempList, '!');
printList(tempList);
// Step 3. Delete some characters (the first occurrence).
deleteElement(tempList, 'e');
deleteElement(tempList, 'a');
deleteElement(tempList, 'o');
printList(tempList);
// Step 4. Insert to a given position.
insertElement(tempList, 'o', 1);
printList(tempList);
}// Of appendInsertDeleteTest
/**
* Address test: beyond the book.
*/
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;
}// Of basicAddressTest
/**
* The entrance.
*/
int main(){
appendInsertDeleteTest();
}// Of main
----------------------------------------------------------------------------------------------------------------------------
2.function by my own
#include<stdio.h>
#include<malloc.h>
typedef struct node
{
int data;
struct node* pNext;
}node ,*Pnode;
Pnode creat_list()
{
int len; int val;
Pnode phead = (Pnode)malloc(sizeof(node));
Pnode ptail = (Pnode)malloc(sizeof(node));
ptail = phead;
if (phead == NULL||ptail==NULL)
{
printf("开辟失败\n");
}
printf("请输入要开辟的链表大小");
scanf_s("%d", &len);
for (int i = 0; i < len; i++)
{
printf("请输入第%d个结点的元素\n", i + 1);
scanf_s("%d", &val);
Pnode pnew = (Pnode)malloc(sizeof(node));
if (pnew == NULL)
{
printf("开辟失败\n");
}
pnew->data = val;
pnew->pNext = NULL;
ptail->pNext = pnew;
ptail = pnew;
}
return phead;
}
void traverse_list(Pnode phead)
{
Pnode p = phead->pNext;
while(p->pNext != NULL)
{
printf("%d", p->data);
p = p->pNext;
}
printf("%d", p->data);
printf("\n");
}
void insert(Pnode phead, int position, int element)
{
//position(在第几个元素后面添加)
Pnode p=phead;
for (int i = 0; i < position; i++) {
p = p->pNext;
if (p == NULL) {
printf("The position %d is beyond the scope of the list.", position);
return;
}
}
Pnode q = (Pnode)malloc(sizeof(node));
q->data = element;
q->pNext = p->pNext;
p->pNext = q;
}
void shanchu(Pnode phead, int position, int element)
{
Pnode p = phead; Pnode q = (Pnode)malloc(sizeof(node));
for (int i = 0; i < position; i++)
{
p = p->pNext;
}
if (p->pNext == NULL)
{
printf("Cannot delete %c\r\n", element);
return;
}
q = p->pNext;
p->pNext = p->pNext->pNext;
free(q);
}
int main()
{
Pnode phead = NULL;
phead = creat_list();//创建链表并把头节点地址赋给phead
traverse_list(phead);//遍历单链表
insert(phead,0,9);//在第一个元素前面插入元素9
traverse_list(phead);
insert(phead,6,9);//在第6个元素后面插入9
traverse_list(phead);
shanchu(phead,0,9);//删掉第1个元素9
traverse_list(phead);
shanchu(phead,5,9);//删掉第7个元素9
traverse_list(phead);
return 0;
}
