双向链表。

最新推荐文章于 2024-07-20 23:14:06 发布

ALICEy_

最新推荐文章于 2024-07-20 23:14:06 发布

阅读量99

点赞数 3

文章标签：链表 windows 数据结构

本文链接：https://blog.csdn.net/ALICEy_/article/details/138141870

版权

本文详细介绍了使用C语言实现的双链表数据结构，包括初始化列表、在给定位置插入元素、删除指定字符以及基本的内存地址操作。通过单元测试展示了这些功能的使用。

摘要由CSDN通过智能技术生成

#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);
 
    //Step4.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();
   }