链表：创建空链表，插入节点，遍历，求长度，查找，删除，反转

#include <stdio.h>
#include <stdlib.h>
/*
链表：创建空链表，插入节点，遍历，求长度，查找，删除，反转
*/
typedef struct node
{
    int data;
    struct node * next;
}NODE;
//创建空链表
NODE * createList()
{
    NODE *head = (NODE *)malloc(sizeof(NODE));
    head->next = NULL;

    return head;
}
//遍历结点
void traverList(NODE * head)
{
    head = head->next;
    while(head)
    {
        printf("%d\n",head->data);
        head = head->next;
    }

    return ;
}
//求链表长度
int lenList(NODE *head)
{
    int len = 0;
    head = head->next;
    while(head)
    {
        len++;
        head = head->next;
    }

    return len;
}
//查找结点
NODE * lookList(NODE *head,int NodeData)
{
    while(head)
    {
        if(head->data == NodeData)
            break;
        else
            head = head->next;
    }
    return head;
}
//删除结点
void deleteNode(NODE *head,NODE *pointer)
{
    while(head->next != pointer)
    {
        head = head->next;
    }
    head->next = pointer->next;
}
//打断链表
NODE * breakList(NODE * head)
{
    NODE *p = head->next;
    head->next = NULL;

    return p;
}
int main(void)
{
    NODE * head = createList();
    //插入节点
    int i;
    printf("请输入结点数据\n");
    scanf("%d",&i);
    while(i)
    {
        NODE * sur = (NODE * )malloc(sizeof(NODE));
        sur->data = i;

        sur->next = head->next;
        head->next = sur;

        scanf("%d",&i);
    }
    traverList(head);
    int len = lenList(head);
    printf("链表长度len = %d\n",len);
    printf("---------查找3这个结点---------\n");
    NODE * pointer = lookList(head,3);
    if(pointer == NULL)
    {
        printf("没有找到3这个结点\n");
    }
    else
    {
        printf("3这个结点的地址为：%p\n",pointer);
        deleteNode(head,pointer);
    }
    traverList(head);
    //链表反转
    printf("---------链表反转----------\n");
    NODE *p = breakList(head);//获取新链表
    //将新链表插入到空链表中去。
    while(p)
    {
        NODE *q = p->next;
        p->next = head->next;
        head->next = p;
        
        p = q;
    }
    traverList(head);

    return 0;
}