Code realization of linear table (C language)

1. Realization of linear table sequence structure

1. Initialize an empty linear list

int InitList(SqList *L){
    
    
	L->elem = (ElemType *) malloc(list_init_size * sizeof(ElemType));
    if (!L->elem) {
    
    
        exit(OVERFLOW);
    }
    L->length = 0;
    L->listsize = list_init_size;
	return OK;
}

2. Add elements to the list

int InputList(SqList *L, int n) {
    
    

    int i, *newbase;

    if (n < 0) {
    
    
        return ERROR;
    }

    if (n > L->listsize) {
    
    

        newbase = (ElemType *) malloc(listincreament * sizeof(ElemType));
        if (!newbase) {
    
    
            exit(OVERFLOW);
        }

        L->elem = newbase;
        L->listsize += listincreament;
    }
    for (i = 0; i < n; i++) {
    
    
        printf("请输入第 %d 个元素：",i+1);
        scanf("%d", &L->elem[i]);
        L->length++;
    }

    return OK;
}

3. Insert elements into the list

int InsertList(SqList *L, int i, int e) {
    
    

    int *newbase;
    int *p;
    int *q;
    if (i < 1 || i > L->length + 1) return ERROR;
    if (L->length >= L->listsize) {
    
    

        newbase = (ElemType *) realloc(L->elem, (L->listsize + listincreament) * sizeof(ElemType));
        if (!newbase) exit(OVERFLOW);
        for (int j = 0; j < L->length; j++) {
    
    
            newbase[j] = L->elem[j];

        }
        L->elem = newbase;
        L->listsize += listincreament;
    }
    q = &(L->elem[i - 1]);
    printf("%d",q);
    for (p = &(L->elem[L->length - 1]); p >= q; p--)
        printf("%d\t",p);
        *(p + 1) = *p;
    *q = e;
    L->length += 1;
    return L->length;
}

4. output the elements in the linear list

int OutputList(SqList *L, int i) {
    
    

    int j;
    printf("更新后的线性表为：");
    for (j = 0; j < i; j++) {
    
    
        printf("%d\t", L->elem[j]);

    }

    return OK;
}

5. Delete the i-th element in the linear list and return its value with e

int DeleteList(SqList *L, int i, int *e) {
    
    

    if (i < 1 || i > L->length) return ERROR;
    e = L->elem[i - 1];
    int *p = &L->elem[i - 1];
    for (int *q = p + 1; q <= p + (L->length - i); q++) *(q - 1) = *q;
    L->length -= 1;
    return OK;
}

6. main function

int main() {
    
    
    SqList S;
    char a;
    a = 'Y';
    int k, data, position, *e;
    InitList(&S);
    printf("请输入元素的个数: ");
    scanf("%d", &k);
    InputList(&S, k);
    while (a == 'Y') {
    
    
        printf("请输入要插入的元素：");
        scanf("%d", &data);
        printf("请输入要插入的位置： ");
        scanf("%d", &position);
        InsertList(&S, position, data);
        printf(&S.length);
        OutputList(&S, k + 1);
        printf("\n请输入要删除的元素的位置： ");
        scanf("%d", &position);
        DeleteList(&S, position, e);
        OutputList(&S, k);
        printf("请问是否继续?(Y:继续 N:结束)\n");
        getchar();
        scanf("%c", &a);

    }

    system("pause");

    return OK;
}

2. Realization of linear table chain structure

1. Initialize an empty linked list

Status InitList(LinkList L){
    
    

    L = (LinkList) malloc(sizeof(LNode));
    if(!L){
    
    
        exit(-1);
    }
    L->next = NULL;

    return OK;
}

2. Find the table length of the linear table

Status GetListLen(LinkList L){
    
    
    LinkList P;
    int count = 0;
    P = L->next;
    while(P){
    
    
        P = P->next;
        count++;
    }

    return count;
}

3. Find elements in the specified bit order

Status CheckListByOrder(LinkList L, int k){
    
    

    LinkList P;
    int count = 1;
    P = L->next;
    while(P && count < k){
    
    
        P = P->next;
        count++;
    }

    if ((count == k)&&P){
    
    
        printf("你查找的元素为:%d\n",P->data);
    } else {
    
    
        printf("元素不存在\n");
    }
}

4. Find elements of a linear list by value

Status CheckListValue(LinkList L, int X){
    
    

    LinkList P;
    P = L->next;
    while(P && (P->data!=X)){
    
    
        P = P->next;
    }
    if (P){
    
    
        printf("查找成功,你查找的元素为:%d",P->data);
    } else {
    
    
        printf("没有此元素");
    }
}

5. Insert elements into the list

Status InsertList(LinkList L, int i, ElemType e){
    
    

    LinkList P, S;
    int count = 0;
    P = L;
    while(P && (count < i-1)){
    
    
        P = P->next;
        count++;
    }
    if (!P || count > i-1){
    
    
        return -1;
    } else {
    
    
        S = (LinkList)malloc(sizeof(LNode));
        S->data = e;
        S->next = P->next;
        P->next = S;
    }

    return OK;
}

6. Delete the specified element in the list

Status DeleteList(LinkList L, int i){
    
    

    LinkList P, Q;
    int count = 0;
    P = L;
    while(P && count < i-1){
    
    
        P = P->next;
        count++;
    }
    if (!(P->next) && count >i-1){
    
    
        printf("参数错误！\n");
    } else {
    
    
        Q = P->next;
        P->next = Q->next;
        free(Q);
    }

    return OK;
}

7. output linear list

void ExportList(LinkList L){
    
    

    LinkList P = L->next;
    printf("更新的链表为:");
    while (P){
    
    
        printf("%d\t",P->data);
        P = P->next;
    }

}

8. main function

int main(){
    
    

    LinkList ML;
    InitList(ML);
    int j,n,x,len,cz,xz,del;
    char a = 'Y';
    while (a == 'Y'){
    
    
    printf("请输入插入值的个数:");
    scanf("%d",&n);
    for (j = 1; j <= n; j++) {
    
    
        printf("请输入第 %d 个插入的值:",j);
        scanf("%d",&x);
        InsertList(ML, j, x);
    }

    // 输出链表的值
    ExportList(ML);
    printf("\n");

    // 求表长
    len = GetListLen(ML);
    printf("链表的长度为:%d\n",len);

    // 按值查找
    printf("请输入按值查找的数:");
    scanf("%d",&cz);
    CheckListValue(ML, cz);
    printf("\n");

    // 按序号查找
    printf("请输入要查找的数的序号:");
    scanf("%d",&xz);
    CheckListByOrder(ML, xz);
    printf("\n");

    // 删除
    printf("请输入要删除数的下标:");
    scanf("%d",&del);
    DeleteList(ML, del);
    ExportList(ML);
    printf("\n");
    printf("请否需要继续:");
    getchar();
    scanf("%c",&a);

    }
    return 0;
}