professor's code:
#include <stdio.h>
#include <malloc.h>
/**
* Double linked list of integers. The key is char.
*/
typedef struct DoubleLinkedNode{
char data;
struct DoubleLinkedNode *previous;
struct DoubleLinkedNode *next;
} DLNode, *DLNodePtr;
/**
* Initialize the list with a header.
* @return The pointer to the header.
*/
DLNodePtr initLinkList(){
DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
tempHeader->data = '\0';
tempHeader->previous = NULL;
tempHeader->next = NULL;
return tempHeader;
}// Of initLinkList
/**
* Print the list.
* @param paraHeader The header of the list.
*/
void printList(DLNodePtr paraHeader){
DLNodePtr p = paraHeader->next;
while (p != NULL) {
printf("%c", p->data);
p = p->next;
}// Of while
printf("\r\n");
}// Of printList
/**
* 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(DLNodePtr paraHeader, char paraChar, int paraPosition){
DLNodePtr p, q, r;
// 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 = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
q->data = paraChar;
// Step 3. Now link.
r = p->next;
q->next = p->next;
q->previous = p;
p->next = q;
if (r != NULL) {
r->previous = q;
}// Of if
}// Of insertElement
/**
* Delete an element from the list.
* @param paraHeader The header of the list.
* @param paraChar The given char.
*/
void deleteElement(DLNodePtr paraHeader, char paraChar){
DLNodePtr p, q, r;
p = paraHeader;
// Step 1. Locate.
while ((p->next != NULL) && (p->next->data != paraChar)){
p = p->next;
}// Of while
// Step 2. Error check.
if (p->next == NULL) {
printf("The char '%c' does not exist.\r\n", paraChar);
return;
}// Of if
// Step 3. Change links.
q = p->next;
r = q->next;
p->next = r;
if (r != NULL) {
r->previous = p;
}// Of if
// Step 4. Free the space.
free(q);
}// Of deleteElement
/**
* Unit test.
*/
void insertDeleteTest(){
// Step 1. Initialize an empty list.
DLNodePtr tempList = initLinkList();
printList(tempList);
// Step 2. Add some characters.
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
insertElement(tempList, '!', 5);
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(){
DLNode 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.
*/
void main(){
insertDeleteTest();
basicAddressTest();
}// Of main
--------------------------------------------------------------------------------------------------------------------------------
functions by my own:
#include<stdio.h>
#include<malloc.h>
typedef struct node
{
int data;
struct node* pNext;
struct node* pPre;
}node, * Pnode;
Pnode creat_list()
{
int len, val;
Pnode phead = (Pnode)malloc(sizeof(node));
Pnode ptail = (Pnode)malloc(sizeof(node));
ptail = phead;
ptail->pNext = NULL;
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;
pnew->pPre = ptail->pNext;
ptail = pnew;
}
return phead;
}
bool is_empty(Pnode phead)
{
if (phead->pNext == NULL)
return true;
else
return false;
}
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.\n", position);
return;
}
}
Pnode q = (Pnode)malloc(sizeof(node));
q->data = element;
//q->pNext = p->pNext;
//p->pNext->pPre = q->pNext;
//p->pNext = q;
//q->pPre = p->pNext;//没有考虑q为最后一位的情况
Pnode r = p->pNext;//必须记录r,因为后面要修改p->pNext
q->pNext = r;//r可能为NULL
q->pPre = p;//先把q的前后指针域确定
p->pNext = q;
if (r != NULL)
{
r->pPre = q->pNext;
}
}
void shanchu(Pnode phead, int position)
{
Pnode p = phead; Pnode q = (Pnode)malloc(sizeof(node));
for (int i = 1; i < position; i++)
{
p = p->pNext;
}
if (p->pNext == NULL)
{
printf("Cannot delete \n");
return;
}
q = p->pNext;
p->pNext = q->pNext;
if (q->pNext != NULL)
{
q->pNext->pPre = p;
}
free(q);
}
int lenth(Pnode phead)
{
int len = 0;
Pnode p = phead;
while (p->pNext != NULL)
{
len++;
p = p->pNext;
}
return len;
}
int main()
{
Pnode phead = NULL;
phead = creat_list();//创建链表并把头节点地址赋给phead
if (is_empty(phead))
{
printf("链表为空\n");
insert(phead, 0, 0);
insert(phead, 1, 1);
insert(phead, 2, 2);
insert(phead, 3, 3);
insert(phead, 4, 4);
printf("插入0,1,2,3,4\n");
traverse_list(phead);
}
else
{
traverse_list(phead);//遍历单链表
}
insert(phead, 0, 9);//在第0个元素(头结点)后面插入元素9
traverse_list(phead);
insert(phead, 6, 9);//在第6个元素后面插入9
traverse_list(phead);
shanchu(phead, 1);//删掉第1个元素9
traverse_list(phead);
shanchu(phead, 6);//删掉第6个元素9
traverse_list(phead);
//sort_list(phead, lenth(phead));
//traverse_list(phead);
return 0;
}