数据结构---顺序表 代码实现

#include <stdio.h>
#include <stdlib.h>
#define LIST_INIT_LEN  10
#define LISTINCREMENT  1
#define OK             1
#define NO               0

typedef struct{
    int     *elem;
    int     length;            //当前位置
    int     listsize;        //序列长度
}SqList;

//初始化序列表
int InitList(SqList *L)

{
    L->elem = (int *)malloc(LIST_INIT_LEN * sizeof(int));
    if(!(L->elem))
    {
        exit(NO);
    }
    L->length = 0;
    L->listsize = LIST_INIT_LEN;
    
    return OK;
}

//是否为空
int IsEmpty(SqList *L)
{
    if(L->length == 0)
    {
        return OK;
    }
    else
        return NO;
}

//插入num进入i元素前面，如果i存在
int ListInsert_Sq(SqList *L, int i, int num)
{
    if(i < 1 || i > L->listsize + 1)                     //如果给的i不在范围内返回
    {
        return NO;
    }
    if(L->length >= L->listsize)                        //如果序列已满，就realloc分配空间
    {
        int *base;
        base = (int *)realloc(L->elem,(L->listsize + LISTINCREMENT) * sizeof(int));
        if(!base)
        {
            exit(NO);                                    //分配失败
        }
        L->elem = base;                            
        L->listsize = L->listsize + LISTINCREMENT;        //增加序列长度
    }


    int *start, *end;

    end = &(L->elem[i - 1]);                            //第i个位置的地址
    for(start = &(L->elem[L->length - 1]); start >= end; --start)    //注意要移动到第i个位置需要将i和i之后的元素后移，所以start >= end
    {
        *(start + 1) = *start;                            //把第i个位置后面的元素后一位
    }

    *end = num;
    (L->length)++;                                        //位置前进一位

    return OK;
}

//删除元素把该元素后续元素前移
int Delete_SqList(SqList *L, int i, int num)    
{
    if(i < 0 || i > L->length)                            //元素坐标不在范围内
    {
        return NO;
    }

    int *pos, *q;
    pos = & (L->elem[i - 1]);                            //待删除元素坐标
    num = *pos;

    q = L->elem + L->length -1;                            //最后一个元素位置
    for(++pos; pos <= q; ++pos)                            //所以元素前移一位
    {
        *(pos - 1) = *pos; 
    }
    L->length--;

    return num;
}

int compare(int num1, int num2)
{
    if((num1 - num2) == 0)
    {
        return OK;
    }
    return NO;
}

int LocateElem_Sq(SqList *L, int num, int (*pfunction)(int num1, int num2))
{
    int *p;
    int i;

    i = 1;    
    p = L->elem;

    while(i <= (L->length) && !(*compare)(num, *p++))
    {
        ++i;
    }

    if(i <= L->length)
    {
        return i;
    }

    return NO;
}

int MergeList_Sq(SqList *L, SqList *L2, SqList *C)
{
    int *pL, *pL2, *pL_last, *pL2_last, *ptr;
    
    pL = L->elem;
    pL2 = L2->elem;

    C->listsize = L->listsize + L2->listsize;
    C->elem = (int *)realloc(C->elem, C->listsize * sizeof(int));
    
    ptr = C->elem;
    if(!(ptr))
    {
        exit(NO);
    }

    pL_last = pL + L->listsize - 1;
    pL2_last = pL2 + L2->listsize - 1;
    
    while(pL <= pL_last && pL2 <= pL2_last)
    {    
        
        if(*pL >= *pL2)
        {
            *ptr= *pL++;
            C->length++;
            ptr++;    
        }
        else
        {
            *ptr= *pL2++;
            C->length++;
            ptr++;
        }
    }
    while(pL <= pL_last)
    {
        *ptr = *pL++;
        C->length++;
        ptr++;
    }
    while(pL2 <= pL2_last)
    {
        *ptr = *pL2++;
        C->length++;
        ptr++;
    }

    return OK;
}
                                                        
int main(void)                                            //序列函数传递的都是指针这样才能对序列做出变动
{
    int         i;
    int         num;
    SqList         *example;
    SqList      *example2;    
    SqList        *example3;                                        //example指向SqList序列指针
    
    example = (SqList *)malloc(sizeof(SqList));    
    example2 =( SqList *)malloc(sizeof(SqList));
    example3 = (SqList *)malloc(sizeof(SqList));        //分配空间
    InitList(example);
    InitList(example2);
    InitList(example3);
        
     ListInsert_Sq(example, 1,12);                        //测试插入函数
     ListInsert_Sq(example, 1,10);
     ListInsert_Sq(example, 1,25);
     
      ListInsert_Sq(example2, 1,11);        
     ListInsert_Sq(example2, 1,14);                        //测试插入函数
     ListInsert_Sq(example2, 1,23);
     
     int go;
     MergeList_Sq(example, example2, example3);
     for(go = 0; go < example3->length; go++)
     {
         printf("loc: %-12d   value: %d\n", go + 1, example3->elem[go]);
     }



    while(getchar() != 'q')
        ;
    return 0;
}