LinkedList.h

LinkedList.h

#include <stdio.h>
#include <stdlib.h>
#define ERROR 0
#define OK 1
#define TRUE 1
#define FALSE 0
#define NOTFOUND -1
#define linkedListDataType int

typedef struct linkedNode{

    linkedListDataType data;
    struct linkedNode* next;

}LNode;

int CreateHead_LinkedList(LNode ** H){

    (*H)->next = NULL;

    int elem;

    scanf("%d",&elem);

    while (elem != -1) {

        LNode* s = (LNode *) malloc(sizeof(LNode));
        s->data = elem;

        s->next = (*H)->next;
        (*H)->next = s;

        scanf("%d", &elem);

    }

    return OK;
}

LNode *Init_LinkedList() {

    LNode *H = (LNode *) malloc(sizeof(LNode));

    if (H == NULL) {
        return ERROR;
    }

    H->next = NULL;
    return H;
}


int CreateTail_LinkedList(LNode ** H){

    (*H)->next = NULL;

    LNode *p = *H;
    int elem;

    scanf("%d",&elem);

    while (elem != -1) {

        LNode* s = (LNode *) malloc(sizeof(LNode));
        s->data = elem;
        s->next = NULL;
        p->next = s;
        p = s;

        scanf("%d", &elem);

    }

}

int GetSize_LinkedList(LNode *H){

    LNode *p = H;
    int size = 0;

    while (p->next != NULL) {
        size++;
        p = p->next;
    }

    return size;

}

int IsEmpty(LNode *H){
    if ( H == NULL || GetSize_LinkedList(H) == 0) {
        return 1;
    }
    return 0;
}


void Print_LinkedList(LNode *H){

    LNode *p = H;
    printf("head -> ");

    while (p->next != NULL) {

        printf("%d -> ", p->next->data);

        p = p->next;
    }

    printf("NULL\n");

}

LNode* GetNode_LinkedList(LNode *H, int index) {

    if (index == -1) {
        return H;
    }

    LNode *p = H;
    int count = 0;

    while (p->next != NULL) {

        p = p->next;

        if (index == count) {
            return p;
        }
        count++;
    }
    return NULL;

}


int DeleteNodeByIndex_LinkedList(LNode *H, int index) {

    LNode *p = GetNode_LinkedList(H, index - 1);
    LNode *q = p->next;
    p->next = p->next->next;
    free(q);
    return OK;
}

int InsertNodeIndexOf_LinkedList(LNode *H, int index, linkedListDataType elem) {

    if (index > GetSize_LinkedList(H)) {
        return ERROR;
    }

    LNode *p = GetNode_LinkedList(H, index - 1);

    LNode* s = (LNode *) malloc(sizeof(LNode));

    if (s == NULL) {
        return ERROR;
    }

    s->data = elem;

    s->next = p->next;
    p->next = s;

    return OK;
}

int InsertNodeTail_LinkedList(LNode *H, linkedListDataType elem) {

    InsertNodeIndexOf_LinkedList(H,GetSize_LinkedList(H),elem);
    return OK;
}


int UpdateNodeByIndex_LinkedList(LNode *H, int index, linkedListDataType elem){

    LNode *p = GetNode_LinkedList(H, index);
    p->data = elem;
    return OK;

}

void DeleteRepeatElem(LNode *H){

    if (H == NULL) {
        return;
    }

    LNode *p = H->next;

    if (p == NULL) {
        return;
    }

    while (p->next != NULL) {

        LNode *q = p->next;

        while (q != NULL) {

            if (p->data == q->data) {
                //删除q结点
                LNode *t = q;
                q = q->next;
                free(t);
                p->next = q;

            } else {
                q = q->next;
            }

        }

        p = p->next;
    }

}

demo.c

#include "LinkedList.h"

int main(){

    LNode *H = Init_LinkedList();
    CreateTail_LinkedList(&H);
    Print_LinkedList(H);

    printf("size = %d\n", GetSize_LinkedList(H));

//    LNode *node = GetNode_LinkedList(H, 1);
//    printf("data = %d\n", node->data);

//    DeleteNodeByIndex_LinkedList(H, 1);
//    Print_LinkedList(H);
//
//    InsertNodeIndexOf_LinkedList(H, 1, 2);
//    Print_LinkedList(H);
//
//    UpdateNodeByIndex_LinkedList(H, 1, 0);
//    Print_LinkedList(H);
//    InsertNodeTail_LinkedList(H, 5);
//    Print_LinkedList(H);

    return 0;
}