数据结构——链表

代码展示：

#include<stdio.h>
#include<malloc.h>

/**
 * Linked list of character. 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
LNode* reverseTable(LNode* head)
{
    if(head == NULL || head->next == NULL){
        return head;//如果是空链或者只有一个结点，则直接返回头文件 
    }
    else{
        LNode* new_head = reverseTable(head->next);//递归，直到找到最后一个结点 
        head -> next ->next = head;
        head -> next = NULL;
        return new_head;
    }
     
}

void headElement(NodePtr paraHeader, char paraChar){
    NodePtr p,q;
    
    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;
    
    p = paraHeader;
    q->next = p->next;
    p->next = q;    
}

/** 
 * 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. Costruct a new code.
    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 fron 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);
    printf("在头部插入一个字母A\n");
    headElement(tempList,'A');
    printList(tempList);
    printf("把刚刚插入的字母删除\n");
    deleteElement(tempList,'A');
    printList(tempList);
    printf("再将单链表反转输出\n");
    tempList = reverseTable(tempList);
    printList(tempList);
    printf("反转回来\n");
    tempList = reverseTable(tempList);
    printList(tempList);
    
    // Step 3. Delete some characters.
    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();
}
 

运行结果展示：