Linux下的C语言编程——链表实现队列操作

ゞ浴缸里的玫瑰 2022-07-15 08:35 339阅读 0赞

用链表实现队列的操作

#include <stdio.h>
    #include <stdlib.h>
    
    struct queue_data
    {
    	int num;
    	struct queue_data *next;
    };
    
    typedef struct queue_data Queue;
    typedef struct queue_data *Link;
    
    void creat_queue(Link *head)
    {
    	*head = (Link)malloc(sizeof(Queue));
    
    	if(!(*head))
    	{
    		printf("malloc error!\n");
    		exit(-1);
    	}
    
    	(*head)->next = NULL;
    }
    
    void creat_node(Link *newnode)
    {
    	*newnode = (Link)malloc(sizeof(Queue));
    
    	if(!(*newnode))
    	{
    		printf("malloc error!\n");
    		exit(-1);
    	}
    }
    
    void insert_tail(Link *head,Link newnode)
    {
    	Link temp = *head;
    	
    	while(temp->next != NULL)
    	{
    		temp = temp->next;
    	}
    
    	newnode->next = NULL;
    	temp->next = newnode;
    }
    
    void get_queue(Link head)
    {
    	Link temp = head->next;
    
    	if(NULL == temp)
    	{
    		printf("empty!\n");
    	}
    
    	while(temp != NULL)
    	{
    		printf("num = %d\n",temp->num);
    		temp = temp->next;
    		
    	}
    }
    
    void pop_queue(Link *head)
    {
    	Link temp = (*head)->next;
    
    	if(!temp)
    	{
    		printf("empty!\n");
    	}
    
    	while(temp != NULL)
    	{
    		(*head)->next = temp->next;
    		printf("num = %d\n",temp->num);
    		free(temp);
    		temp = (*head)->next;
    		
    	}
    	printf("succes\n");
    	
    }
    
    int main()
    {
    	Link head;
    	Link newnode;
    	
    	int i;
    	int num;
    
    	creat_queue(&head);
    
    	for(i = 0; i < 10; i++)
    	{
    		creat_node(&newnode);
    		newnode->num = i + 1;
    		insert_tail(&head,newnode);
    	}
    
    	get_queue(head);
    
    	pop_queue(&head);
    
    	get_queue(head);
    
        return 0;
    }