链表基础_C语言

#include <stdio.h>
#include <stdlib.h>


typedef struct Node
{
    int value;
    struct Node *pNext;
}NodeList;

NodeList *createNodeList()
{
    NodeList *head = (NodeList*)malloc(sizeof(NodeList));
    head->value = 0;
    head->pNext = NULL;
    return head;
}

NodeList *addList(NodeList *list, int n)
{
    NodeList *new_list = (NodeList*)malloc(sizeof(NodeList));
    if(new_list == NULL)
    {
        printf("Error: malloc failed in add to list\n");
        exit(EXIT_FAILURE);
    }
    new_list->value = n;
    list->pNext = new_list;
    new_list->pNext = NULL;
    return new_list;
}

void printList(NodeList *list)
{
    while(list->pNext != NULL)
    {
        list = list->pNext;
        printf("%d\n", list->value);
    }
}

void deleteList(NodeList *list)
{
    NodeList *temp = list->pNext;
    if(temp != NULL)
    {
        list->pNext = temp->pNext;
        free(temp);
    }
    else
    {
        printf("Error: delete list fail\n");
        exit(EXIT_FAILURE);
    }
}

int main(void)
{
    int n;
    NodeList *temp = NULL;
    NodeList *first = createNodeList();
    temp = addList(first, 0);
    for(n = 10; n <= 100; n += 10)
    {
        temp = addList(temp, n);
    }
    deleteList(first->pNext);
    printList(first);
    return 0;
}