隊(duì)列的特征就是“先入先出”，入隊(duì)時(shí)在鏈表的尾部插入數(shù)據(jù)，出隊(duì)時(shí)刪除掉頭節(jié)點(diǎn)后面的節(jié)點(diǎn)，需要一個(gè)尾指針，始終指向鏈表的尾部（新加進(jìn)來的節(jié)點(diǎn)）。具體請(qǐng)看原理圖：

代碼實(shí)現(xiàn)

#include <stdio.h> #include <stdlib.h>typedef struct List {int data; //數(shù)據(jù)域struct List *next; //指針域 }ListNode; //節(jié)點(diǎn)信息ListNode *rear; //尾指針void Init(ListNode *head); //隊(duì)列初始化 void push(ListNode *head, int data); //入隊(duì) void pop(ListNode *head); //出隊(duì) void print(ListNode *head); //顯示隊(duì)內(nèi)元素int main() {ListNode head;Init(&head);push(&head, 1);print(&head);pop(&head);print(&head);pop(&head);print(&head);system("pause");return 0; }void Init(ListNode *head) {head->data = 0;head->next = head;rear = head; //尾指針指向頭節(jié)點(diǎn) }void push(ListNode *head,int data) {ListNode *tem = (ListNode *)malloc(sizeof(ListNode));if (tem == NULL){printf("創(chuàng)建新節(jié)點(diǎn)失敗，入隊(duì)失敗");return;}rear->next = tem; //尾指針指向的節(jié)點(diǎn)的指針指向新節(jié)點(diǎn)tem->data = data;tem->next = head; //尾結(jié)點(diǎn)指向頭，實(shí)現(xiàn)循環(huán)rear = tem; //尾指針后移 }void pop(ListNode *head) {if (head ->next == head){printf("隊(duì)內(nèi)無(wú)元素，出隊(duì)錯(cuò)誤\n");return;}ListNode *tem = head->next;head->next = tem->next; //頭節(jié)點(diǎn)指向下下個(gè)節(jié)點(diǎn)printf("出隊(duì)元素: %d\n", tem->data);if (tem->next == head){rear = head; //刪除到最后一個(gè)元素時(shí)，尾指針指向頭節(jié)點(diǎn)}free(tem);tem=NULL; }void print(ListNode *head) {ListNode *tem = head->next;if (tem == head){printf("當(dāng)前隊(duì)列無(wú)元素\n");return;}for (; tem != head; tem = tem->next){printf("%d ", tem->data);}printf("\n"); }

總結(jié)

以上是生活随笔為你收集整理的带头节点循环链表实现队列的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。