（20220215）不带头节点的单链表

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
	
#define MALLOC_OK 1
#define MALLOC_NO 0
#define CREATE_OK 1
#define CREATE_NO 0

struct node
{
    int num;
    char name[10];
    int age;
    char sex;

    struct node *next;
};

typedef struct node Node;
typedef Node * Link;

void create_link(Link *head)  //创建链表
{
    *head = NULL;
}

int is_malloc_ok(Link new_node)   //节点分配成功函数
{
    if(NULL == new_node)
    {
	return MALLOC_NO;
    }
    return MALLOC_OK;
}

int create_new_node(Link *new_node)  //创建节点
{
    *new_node = (Link)malloc(sizeof(Node));
    
    if(MALLOC_OK == is_malloc_ok(*new_node))
    {
	return CREATE_OK;
    }    
    return CREATE_NO;
}

void insert_link_tail(Link *head, Link new_node)  //插入链表，尾插法
{
    Link p = NULL;
    p = *head;

    if(NULL == *head)
    {
	*head = new_node;
	new_node->next = NULL;
    }
    else
    {
	while(p->next != NULL)
	{
	    p = p->next;
	}
	p->next = new_node;
	new_node->next = NULL;
    }
}

void insert_link_head(Link *head, Link new_node)   //插入链表，头插法
{
    new_node->next = *head;
    *head = new_node;
}

void insert_link_mid_front(Link *head, Link new_node, int num) //在链表节点前插入新节点
{
    Link p = NULL, q = NULL;
    p = q = *head;

    while(p != NULL && p->num != num)
    {
	q = p;
	p = p->next;
    }
    if (p == *head)
    {
	new_node->next = *head;
	*head = new_node;
    }
    else
    {
	new_node->next = p;
	q->next = new_node;
    }
}

void insert_link_mid_rear(Link *head, Link new_node, int num)  //在链表节点后插入新节点
{
    Link p = NULL;
    p = *head;

    if(NULL == *head)
    {
	*head = new_node;
        new_node->next = NULL;
    }
    else
    {
	while(p->next != NULL && p->num != num)
	{
            p = p->next;
	}
	new_node->next = p->next;
        p->next = new_node;

    }

}

void insert_sort(Link *head, Link new_node)  //插入并排序
{
    Link q = NULL, p = NULL;
    p = q = *head;

    while(p != NULL && p->num < new_node->num)
    {
	q = p;
	p = p->next;

    }
    if (p == *head)
    {
	new_node->next = *head;
	*head = new_node;
    }
    else
    {
	new_node->next = p;
	q->next = new_node;
    }
}

void delete_node(Link *head, int num) //删除链表节点
{
    Link p = NULL, q = NULL;
    p = q = *head;

    if(NULL == *head)
    {
	printf("the link is NULL!\n");
	return ;
    }

    while(p != NULL && p->num != num)
    {
	q = p;
	p = p->next;
    }
    if(p == *head)
    {
	*head = (*head)->next;
	free(p);
    }
    else if (p == NULL)
    {
	printf("no node delete!\n");
    }
    else
    {
	q->next = p->next;
	free(p);
    }
}

void reverse_link(Link *head)    //将链表置换
{
    Link p1 = NULL, p2 = NULL, p3 = NULL;
    p1 = *head;

    if(NULL == *head)
    {
	printf("the link is NULL!\n");
    }

    if(p1->next == NULL)
    {
	return ;
    }

    p2 = p1->next;
    p3 = p2->next;

    while(p3 != NULL)
    {
	p2->next = p1;
	p1 = p2;
	p2 = p3;
	p3 = p3->next;
    }

    p2->next = p1;

    (*head)->next = NULL;

    *head = p2;
}

Link seek_node_num(Link head, int num)    //查找数值
{
    Link p = NULL;
    p = head;

    if(NULL == head)
    {
	printf("the link is NULL!\n");
	return NULL;
    }

    while(p != NULL && p->num != num)
    {
	p = p->next;
    }
    if(NULL == p)
    {
	return NULL;
    }
    else
    {
	return p;
    }
}

void seek_node_loc(Link head, int loc)      //按位置查找数值
{
    Link p = NULL;
    p = head;
    int count = 1;

    while(p != NULL && count != loc)
    {
	p = p->next;
	count++;
    }
    if(p == NULL)
    {
	printf("no seek node!\n");
    }
    else
    {
	printf("%d\n", p->num);
    }
    
}

void link_long(Link head)   //计算链表长度
{
    Link p = NULL;
    p = head;
    int i = 0;

    if(head == NULL)
    {
	printf("the link is NULL!\n");
    }
    else
    {
	while(p != NULL)
	{
	    i++;
            p = p->next;
	}
	printf("%d\n", i);
    }
}


void link_sort(Link head) //链表排序
{
    Link p = NULL, q = NULL;
    Link p1 = NULL, q1 = NULL;
    q = p = p1 = q1 = head;

    while()
}

void display_link(Link head)   //遍历链表
{
    Link p = NULL;
    p = head;

    if(NULL == head)
    {
        printf("the link is NULL!\n");
	return ;
    }
    else
    {
	while(p != NULL)
	{
	    printf("%d\n", p->num);
	    p = p->next;
	}
    }
}

void release_link(Link *head)  //释放链表
{
    Link p = NULL;
    p = *head;

    if(NULL == *head)
    {
	printf("the link is NULL!\n");
	return ;
    }
    else
    {
	while(NULL != *head)
	{
	    *head = (*head)->next;
	    free(p);
	    p = *head;
	}
    }

}

int main()
{
    Link head = NULL;
    Link new_node = NULL;
    int i;
    int num;
    int loc;
    srand((unsigned)time(NULL));

    create_link(&head);  //创建链表
    for(i = 0; i < 10; i++)
    {
        if(CREATE_OK == (create_new_node(&new_node)))  //创建节点
        {
	    new_node->num = rand()%100;
	  //  new_node->num = i + 1;
          //  insert_link_tail(&head, new_node);  //插入链表，尾插法
            insert_link_head(&head, new_node);   //插入链表，头插法
	   // insert_sort(&head, new_node);   //插入排序
        }
    }
    display_link(head);   //遍历链表


#if 0
    printf("please input number of insert:\n");
    scanf("%d", &num);
    if(CREATE_OK == (create_new_node(&new_node)))  //创建节点
    {
	printf("please input number:\n");
	scanf("%d", &new_node->num);
	insert_link_mid_front(&head, new_node, num); //在链表节点前插入新节点
	//insert_link_mid_rear(&head, new_node, num);  //在链表节点后插入新节点
    }
    display_link(head);
#endif
    

#if 0
    printf("please input number of delete:\n");
    scanf("%d", &num);
    delete_node(&head, num);  //删除链表中的一个节点
    display_link(head);
#endif


#if 0
    printf("the link reverse is:\n");
    reverse_link(&head);    //将链表置换
    display_link(head);
#endif

#if 0
    printf("please input num/location:\n");
    scanf("%d", &num);
    //scanf("%d", &loc);
    Link p = NULL;
    p = seek_node_num(head, num);    //按数值查找数值
    printf("the number is:%d\n", p->num);
   // seek_node_loc(head, loc);      //按位置查找数值
#endif

#if 0
    printf("the link long is:\n");
    link_long(head);   //计算链表长度
#endif

#if 1  //链表的排序
    link_sort(&head);  //链表的排序
    display_link(head); //遍历链表
#endif
    release_link(&head);  //释放链表
    display_link(head);   //遍历链表
    
    return 0;
}