数据结构 2.2章：单链表（c）

前言

提示：这里可以添加本文要记录的大概内容：
上节课讲了顺序结构表具有按物理关系存储数据的特点，其尾删（插）效率高，访问快但是随机插入和删除效率不高，且长度固定。而本次讲到链式结构表，其存储空间不连续，如果知道处理节点位置复杂度为1，重要的是没有空间限制，可以合理利用空间。
#代码

#include<stdio.h>
#include<stdlib.h>

/*
*Linked list of characters. The key is data.
*/
typedef struct LinkNode{
    char data;
    struct LinkNode *next;
}LNode,*NodePtr,*LinkList;
//函数声明
LinkList initLinkList(void);
void printList(NodePtr paraHeader);
void appendElement(NodePtr paraHeader, char paraChar);
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition);
void deleteElement(NodePtr paraHeader, char paraChar);
void appendInsertDeleteTest(void);
void basicAddressTest(void);
int main(void)
{
    appendInsertDeleteTest();
    return 0;
}

/*
**initialize the list with a header.
*@return The pointer to the header.
*/
LinkList initLinkList(void)
{
    NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
    tempHeader->data = '\0';
    tempHeader->next = NULL;
    return tempHeader;
}

/**
*Value the list
*@param paraHeader the header of the list.
*/
void printList(NodePtr paraHeader)
{
    NodePtr p = paraHeader->next;
    while(p)
    {
        printf("%c",p->data);
        p = p->next;
    }
    printf("\r\n");
}
/*
 *Add an element to the tail.
 *@param paraHeader the header of the list.
 *@param paraChar the give 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;
    }

    //step 3. Now add/link.
    p->next = q;
}
/**
 *insert an element to the given position.
 *@param paraHeader The header of the list.
 *@param paraChar the give char
 *@param paraPosition the give posistion .
*/
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition)
{
    NodePtr p, q;

    // Step 1. Search to the position.
    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. 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;
}

/**
 * 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;
    }

    if (p->next == NULL)
    {
        printf("Cannot delete %c\r\n", paraChar);
        return;
    }

    q = p->next;
    p->next = p->next->next;
    free(q);
}

/**
 * Unit test.
 */
void appendInsertDeleteTest(void)
{
    // 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);
}

/**
 * Address test: beyond the book.
 */
void basicAddressTest(void)
{
    LNode tempNode1, tempNode2;

    tempNode1.data = 4;
    tempNode1.next = NULL;

    tempNode2.data = 6;
    tempNode2.next = NULL;

    printf("The first node: %p, %p, %p\r\n",
           &tempNode1, &tempNode1.data, &tempNode1.next);
    printf("The second node: %p, %p, %p\r\n",
           &tempNode2, &tempNode2.data, &tempNode2.next);

    tempNode1.next = &tempNode2;
}

---

总结

链表常用结构为头指针->头节点.指针域->首元节点（一个节点分为数据域和指针域）
使用链表时，要牢牢记住要操作节点的位置变化，链断开时要保存后面节点的钥匙（前一个节点的指针域）