dynamic-sequential-list.cpp

// dynamic sequential list
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 100
typedef int Elemtype;
typedef struct
{
    Elemtype *data;
    int length;
}Seqlist;
//initial
Seqlist* initiallist()
{
    Seqlist *L = (Seqlist *)malloc(sizeof(Seqlist));
    if(L==NULL) return NULL;
    L->data = (Elemtype*)malloc(sizeof(Elemtype)*MAXSIZE);
    if(L->data == NULL) 
    {
        free(L);
        return NULL;
    }
    L->length = 0;
    return L;
}

//append element to the list
int appendElem(Seqlist *L, int append_elem)
{
    //check if the list is full
    if(L->length>=MAXSIZE)
    {
        printf("The list is full!\n");
        return 0;
    }
    L->data[L->length] = append_elem;
    L->length++;
    return 1;
}


//delete element in the list
int deleteElem(Seqlist *L, int pos, Elemtype *e)
{
    if(L->length == 0)
    {
        printf("Empty list!\n");
    }
    if(pos < 1 || pos > L->length)
    {
        printf("Can't find thre position!\n");
        return 0;
    }
    *e = L->data[pos-1];// 修正: 使用pos-1而不是L->length
    for(int i = pos-1;i<L->length - 1;i++)
    {
        L->data[i] = L->data[i+1];
    }
    L->length--;// 修正: 最后不要忘记让表长减1 
    return 1;
}

//modify element in the list
int modifyElem(Seqlist *L, int pos,int *prev,int next)
{
    if(L->length == 0)
    {
        printf("Empty list!\n");
        return 0;
    }
    if(pos<1 || pos>L->length)
    {
        printf("Can't fin the position!\n");
        return 0;
    }
    *prev = L->data[pos-1];
    L->data[pos-1] = next;
    return 1;
}

void print(Seqlist *L)
{
    for(int i=0;i<L->length;i++)
    {
        printf("%d ",L->data[i]);// 修正：使用 i 而不是 L->length
    }
    printf("\n");
}

//search the position of an element
int searchElem(Seqlist *L,int *search_pos,Elemtype elem)
{
    for(int i = 0; i < L->length;i++)
    {
        if(L->data[i] == elem)
        {
            *search_pos = ++i;
            return 1;
        }
    }
    printf("Search failed!\n");
    return 0;
}

int main()
{
    // initial
    Seqlist* list = initiallist();
    if(list->data == NULL){
        printf("Memory allocation failed!\n");
        return 0;
    }
    printf("Initial!\nThe list occupies %zu Bytes!\n%d element in the list!\n",sizeof(*list->data)*MAXSIZE,list->length);

    // add
    appendElem(list,9);
    appendElem(list,19);
    appendElem(list,29);
    print(list);

    // delete
    Elemtype e;
    if(deleteElem(list,3,&e))
    {
        printf("delete %d\n",e);
    }
    else
    {
        printf("delete error\n");
    }
    print(list);

    // modify
    Elemtype modify_prev;
    if(modifyElem(list,2,&modify_prev,18))
    {
        printf("18 replace the element %d\n",modify_prev);
    }
    else
    {
        printf("Modify error!\n");
    }
    print(list);

    // search
    int search_pos;
    if(searchElem(list,&search_pos,18))
    {
        printf("18 is on the position %d in the list\n",search_pos);
    }
    else
    {
        printf("Search failed!\n");
    }
    free(list->data);
    free(list);
}
//There are many repeated sentences in main and other functions.
//It just let me debug more convenient.