听了国嵌唐老师的课，用C语言实现如下：

数据结构：队列的顺序实现_数据结构


SeqQueue.h

#ifndef _SEQQUEUE_H_
#define _SEQQUEUE_H_

typedef void SeqQueue;

SeqQueue* SeqQueue_Create(int capacity);

void SeqQueue_Destroy(SeqQueue* queue);

void SeqQueue_Clear(SeqQueue* queue);

int SeqQueue_Append(SeqQueue* queue,void* item);

void* SeqQueue_Retrieve(SeqQueue* queue);

void* SeqQueue_Header(SeqQueue* queue);

int SeqQueue_Length(SeqQueue* queue);

int SeqQueue_Capacity(SeqQueue* queue);

#endif

SeqQueue.c

#include "SeqList.h"
#include "SeqQueue.h"

SeqQueue* SeqQueue_Create(int capacity)
{
  return SeqList_Create(capacity);
}

void SeqQueue_Destroy(SeqQueue* queue)
{
  SeqList_Destory(queue);
}

void SeqQueue_Clear(SeqQueue* queue)
{
  SeqList_Clear(queue);
}

int SeqQueue_Append(SeqQueue* queue,void* item)
{
  return SeqList_Insert(queue,item,SeqList_Length(queue));
}

void* SeqQueue_Retrieve(SeqQueue* queue)
{
  return SeqList_Delete(queue,0);
}

void* SeqQueue_Header(SeqQueue* queue)
{
  return SeqList_Get(queue,0);
}

int SeqQueue_Length(SeqQueue* queue)
{
  return SeqList_Length(queue);
}

int SeqQueue_Capacity(SeqQueue* queue)
{
  return SeqList_Capacity(queue);
}

main.c

#include <stdio.h>
#include <stdlib.h>
#include "SeqQueue.h"
/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char *argv[])
{
  SeqQueue* queue = SeqQueue_Create(20);
  int a[10]={0};
  int i=0;
  
  for(i=0;i<10;i++)
  {
    a[i] = i+1;
    
    SeqQueue_Append(queue,a+i);
  }
  
  printf("Header:%d\n",*(int*)SeqQueue_Header(queue));
  printf("Length:%d\n",SeqQueue_Length(queue));
  printf("Capacity:%d\n",SeqQueue_Capacity(queue));
  
  while(SeqQueue_Length(queue)>0)
  {
    printf("Retrieve:%d\n",*(int*)SeqQueue_Retrieve(queue));
  }
  
  SeqQueue_Destroy(queue);
  
  return 0;
}

运行效果：

数据结构：队列的顺序实现_c语言_02