顺序表的链式存储及操作

相比于顺序存储，链式存储的优点有以下几点：
1.插入和删除操作效率高于顺序表，当数据规模越大时，效率提高越明显；
2.链式存储不需要大片连续内存空间，每个数据结点占据很少一段内存通过指针将其串起来，从而达到灵活使用的目的；
当然链式存储也有不足之处：
当遍历顺序表中的元素时需要从链表头部依次查找才能定位到要查询的数据结点；
实现代码：
seq_link.h

#ifndef _SEQ_LINK_H
#define _SEQ_LINK_H
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define SEQ_ERR (-1)
#define SEQ_SUCCESS 0
#define DATA_TYPE_IS_CHAR

#if defined DATA_TYPE_IS_INT
typedef int DataType;
#elif defined DATA_TYPE_IS_CHAR
typedef char DataType;
#elif defined DATA_TYPE_IS_FLOAT
typedef float DataType;
#endif

typedef struct seq_link_node{
	DataType data;
	struct seq_link_node *next;
}*PLinkNode, LinkNode;
typedef struct seq_link{
	PLinkNode linkNode;
    PLinkNode tailNode;
	int length;
}*PSeqLink, SeqLink;

/* 创建一个空链表 */
PSeqLink CreateSeqLink();
/* 插入一个元素 */
int InsertIntoSeqLink(PSeqLink head, const DataType data, const int index);
/* 删除一个元素 */
int DeleteFromSeqLink(PSeqLink head, const int index);
/* 查找一个元素第一次出现的位置 */
int SearchInSeqLink(PSeqLink head, const DataType data);
/* 修改一个元素的值 */
int ModifySeqLinkElment(PSeqLink head, const DataType data, const int index);
/* 获取链表的长度 */
int GetSeqLinkLength(PSeqLink head);
/* 判断链表是否为空 */
int SeqLinkIsEmpty(PSeqLink head);
/* 遍历链表元素 */
void DisplaySeqLink(PSeqLink head);
/* 将链表元素清空 */
int ClearSeqLink(PSeqLink head);
/* 将链表销毁 */
void DestroySeqLink(PSeqLink head);
#endif

seq_link.c

#include "seq_link.h"

PSeqLink CreateSeqLink()
{
    PSeqLink head = (PSeqLink)malloc(sizeof(SeqLink));
    if(head == NULL) {
        perror("head malloc error.");
        return (PSeqLink)SEQ_ERR;
    }

    head->length = 0;
    head->linkNode = NULL;
    head->tailNode = NULL;
    return head;
}

int InsertIntoSeqLink(PSeqLink head, const DataType data, const int index)
{
    if(head == NULL) {
        perror("head is null.");
        return SEQ_ERR;
    }
    if(index > head->length || index < 0)
    {
        perror("invalid index.");
        return SEQ_ERR;
    }
    PLinkNode addNode = (PLinkNode)malloc(sizeof(LinkNode));
    if(addNode == NULL) {
        perror("add node malloc error.");
        return SEQ_ERR;
    }
    addNode->data = data;
    addNode->next = NULL;
    if(index == 0) {
        if(head->length == 0) {
            head->linkNode = addNode;
            head->tailNode = addNode;
        } else {
            addNode->next = head->linkNode;
            head->linkNode = addNode;
        }
    } else if(index == (head->length)) {
        head->tailNode->next = addNode;
        head->tailNode = addNode;
    } else {
        PLinkNode temp = head->linkNode;
        int destIndex = 0;
        while(destIndex < index - 1) { /* find the previous node of the dest node */
            temp = temp->next;
            destIndex++;
        }
        addNode->next = temp->next;
        temp->next = addNode;
    }

    head->length++;
    return SEQ_SUCCESS;
    
}

int DeleteFromSeqLink(PSeqLink head, const int index)
{
    if(head == NULL) {
        perror("head is null.");
        return SEQ_ERR;
    }
    if(index >= head->length || index < 0)
    {
        perror("invalid delete index or no data in link.");
        return SEQ_ERR;
    }
    PLinkNode temp = head->linkNode;
    int destIndex = 0;
    if(index == 0) {
        head->linkNode = temp->next;
        free(temp);
    } else {
        while(destIndex < index - 1) {
            temp = temp->next;
            destIndex++;
        }
        PLinkNode delNode = temp->next;
        temp->next = delNode->next;
        free(delNode);
    }
    head->length--;

    return SEQ_SUCCESS;
}

int SearchInSeqLink(PSeqLink head, const DataType data)
{
    if(head == NULL) {
        perror("head is null.");
        return SEQ_ERR;
    }
    int destIndex = 0;
    PLinkNode temp = head->linkNode;
    while(temp != NULL) {
        if(temp->data == data) {
            return destIndex;
        }
        temp = temp->next;
        destIndex++;
    }

    return SEQ_ERR; // can not find the dest node
        
}

int ModifySeqLinkElment(PSeqLink head, const DataType data, const int index)
{
    if(head == NULL) {
        perror("head is null.");
        return SEQ_ERR;
    }
    if(index < 0 || index >= head->length) {
        perror("invalid index value.");
        return SEQ_ERR;
    }
    int destIndex = 0;
    PLinkNode temp = head->linkNode;
    while(destIndex < index) {
        temp = temp->next;
        destIndex++;
    }
    temp->data = data;
    return SEQ_SUCCESS;
}

int GetSeqLinkLength(PSeqLink head)
{
    if(head == NULL) {
        perror("head is null.");
        return SEQ_ERR;
    }
    
    return head->length;
}

int SeqLinkIsEmpty(PSeqLink head)
{
    if(head == NULL) {
        perror("head is null.");
        return SEQ_ERR;
    }
    
    return (head->length == 0);
}

void DisplaySeqLink(PSeqLink head)
{
    if(head == NULL || head->length == 0) {
        perror("no data in the link.");
        return;
    }
    PLinkNode temp = head->linkNode;
    while(temp != NULL) {
        #if defined DATA_TYPE_IS_INT
        printf("%d ",temp->data);
        #elif defined DATA_TYPE_IS_CHAR
        printf("%c ",temp->data);
        #elif defined DATA_TYPE_IS_FLOAT
        printf("%f ",temp->data);
        #endif
        temp = temp->next;
    }
    printf("\n");

    return;
}

int ClearSeqLink(PSeqLink head)
{
    if(head == NULL) {
        perror("head is null.");
        return SEQ_ERR;
    }
    PLinkNode temp = head->linkNode;
    while(temp != NULL) {
        memset(&temp->data, 0, sizeof(DataType));
        temp = temp->next;
    }
}

void DestroySeqLink(PSeqLink head)
{
    if(head == NULL) {
        perror("head is null.");
        return;
    }
    for(int i=head->length - 1; i>=0; i--) {
        DeleteFromSeqLink(head, i);
    }

    free(head);
    printf("destroy seq link completed.\n");
    return;
}

main.c

#include "seq_link.c"

int main(void)
{
    PSeqLink myHead = CreateSeqLink();
    int ret = 0;
    for(int i=0; i<10; i++) {
        ret = InsertIntoSeqLink(myHead, i+1 + 'A', i);
        if(ret != SEQ_SUCCESS) {
            perror("inser into seq link error.");
            return SEQ_ERR;
        } 
    }
    DisplaySeqLink(myHead);
    InsertIntoSeqLink(myHead, 20 + 'A', 3);
    DisplaySeqLink(myHead);
    DeleteFromSeqLink(myHead, 1);
    DeleteFromSeqLink(myHead, 0);
    DisplaySeqLink(myHead);
    printf("length of link is:%d\n", GetSeqLinkLength(myHead));
    printf("link is empty?[%s]\n", SeqLinkIsEmpty(myHead)?"yes":"no");
    printf("'D' is in the link?[%s]\n", SearchInSeqLink(myHead,'D') != SEQ_ERR?"yes":"no");
    printf("'V' is in the link?[%s]\n", SearchInSeqLink(myHead,'V') != SEQ_ERR?"yes":"no");
    ModifySeqLinkElment(myHead, 'Z', 1);
    DisplaySeqLink(myHead);
    ClearSeqLink(myHead);
    DestroySeqLink(myHead);
	return 0;
}