数据结构 链队列

一，代码

#include <stdio.h>
#include <malloc.h>

typedef struct LinkNode{
    int data;
    struct LinkNode* next;
}*LinkNodePtr;

typedef struct LinkQueue{
    LinkNodePtr front;
    LinkNodePtr rear;
}*LinkQueuePtr;

LinkQueuePtr initQueue(){
    LinkQueuePtr resultPtr = (LinkQueuePtr)malloc(sizeof(struct LinkQueue));
    LinkNodePtr headerPtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
    headerPtr->next = NULL;
    
    resultPtr->front = headerPtr;
    resultPtr->rear = headerPtr;
    return resultPtr;
}

void outputLinkQueue(LinkQueuePtr paraQueuePtr){
    LinkNodePtr tempPtr = paraQueuePtr->front->next;
    while (tempPtr != NULL) {
        printf("%d", tempPtr->data);
        tempPtr = tempPtr->next;
    }
    printf("\r\n");
}

void enqueue(LinkQueuePtr paraQueuePtr, int paraElement) {
	LinkNodePtr tempNodePtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
	tempNodePtr->data = paraElement;
	tempNodePtr->next = NULL;
	
	paraQueuePtr->rear->next = tempNodePtr;
	
	paraQueuePtr->rear = tempNodePtr;
}

int dequeue(LinkQueuePtr paraQueuePtr) {
    int resultValue;
    LinkNodePtr tempNodePtr;
    
    if (paraQueuePtr->front == paraQueuePtr->rear) {
        printf("The queue is empty.\r\n");
        return -1;
    }
    
    tempNodePtr = paraQueuePtr->front->next;
    resultValue = tempNodePtr->data;
    paraQueuePtr->front->next = paraQueuePtr->front->next->next;
    
    if (paraQueuePtr->rear == tempNodePtr) {
        paraQueuePtr->rear = paraQueuePtr->front;
    }
    
    tempNodePtr = NULL;
    
    return resultValue;
}

void testLinkQueue(){
    LinkQueuePtr tempQueuePtr;
    tempQueuePtr = initQueue();
    enqueue(tempQueuePtr, 10);
    enqueue(tempQueuePtr, 30);
    enqueue(tempQueuePtr, 50);
    
    outputLinkQueue(tempQueuePtr);
    
    printf("dequeue gets %d\r\n", dequeue(tempQueuePtr));
    printf("dequeue gets %d\r\n", dequeue(tempQueuePtr));
    printf("dequeue gets %d\e\n", dequeue(tempQueuePtr));
    printf("dequeue gets %d\e\n", dequeue(tempQueuePtr));
    
    enqueue(tempQueuePtr, 8);
    outputLinkQueue(tempQueuePtr);
}

int main(){
    testLinkQueue();
    return 0;
}

二，运行结果