如題;這是一套完整的可運行的代碼;需要讀者有一定的基礎去閱讀;
語言是用C語言實現;在C++環境中編寫;在C++中可直接運行;在C語言中需要改部分頭文件和輸出語句;
頭文件;這要是代碼的聲明部分;
# ifndef _LINKQUEUE_
# define _LINKQUEUE_
# include <iostream>
using namespace std;
typedef int DataType;
typedef struct Node
{
DataType data;
struct Node * next;
}LinkQueue, * PLinkQueue;
//由於僅帶尾指針的單循環鏈表尾指針不斷變化, 所以只能傳遞地址,通過地址改變實參的值;
PLinkQueue CreateLinkQueue(void);
void DestroyLinkQueue(PLinkQueue * pR);
bool EmptyLinkQueue(PLinkQueue * pR);
bool InLinkQueue(PLinkQueue * pR, DataType x);
bool OutLinkQueue(PLinkQueue * pR, DataType * val);
bool FrontLinkQueue(PLinkQueue * pR, DataType * val);
# endif
實現文件;主要是代碼的實現;
# include "LinkQueue.h"
PLinkQueue CreateLinkQueue(void)
{
PLinkQueue R = (PLinkQueue)malloc(sizeof(LinkQueue));
if (NULL != R)
{
R->data = 0;
R->next = R;
return R;
}
else
{
cout << "Memory allocate is errir! " << endl;
system("pause");
exit(0);
}
}
void DestroyLinkQueue(PLinkQueue * pR)
{
PLinkQueue H = *pR;
PLinkQueue p = H->next;
PLinkQueue q = NULL;
while (p != H)
{
q = p;
p = p->next;
free(q);
q = NULL;
}
free(H);
*pR = NULL;
return;
}
bool EmptyLinkQueue(PLinkQueue * pR)
{
PLinkQueue R = *pR;
if (R->next == R)
{
return true;
}
else
{
return false;
}
}
bool InLinkQueue(PLinkQueue * pR, DataType x)
{
PLinkQueue R = *pR;
PLinkQueue p = (PLinkQueue)malloc(sizeof(LinkQueue));
if (NULL == p)
{
return false;
}
else
{
p->data = x;
p->next = NULL;
p->next = R->next;
R->next = p;
*pR = p;
return true;
}
}
bool OutLinkQueue(PLinkQueue * pR, DataType * val)
{
PLinkQueue R = *pR;
PLinkQueue H = R->next;
if (EmptyLinkQueue(pR))
{
return false;
}
else
{
PLinkQueue p = H->next;
H->next = p->next;
*val = p->data;
if (p == R)
{
*pR = H;
}
free(p);
p = NULL;
return true;
}
}
bool FrontLinkQueue(PLinkQueue * pR, DataType * val)
{
PLinkQueue R = *pR;
PLinkQueue H = R->next;
if (EmptyLinkQueue(pR))
{
return false;
}
else
{
return H->next->data;
}
}
Main函數;
# include "LinkQueue.h"
int main(int argc, char ** argv)
{
DataType val = 0;
PLinkQueue R = CreateLinkQueue();
for (int i = 0; i < 10; i++)
{
InLinkQueue(&R, i + 1);
}
for (int i = 0; i < 10; i++)
{
OutLinkQueue(&R, &val);
cout << val << " ";
}
DestroyLinkQueue(&R);
if (NULL == R)
{
cout << "test" << endl;
}
system("pause");
return 0;
}