1.（循环）队列顺序存储

    1. #include <stdio.h>
    2. #include <stdlib.h>
    3. #define MaxSize 100
    5. struct QNode
    6. {
    7.     int Data[MaxSize];
    8.     int rear;
    9.     int front;
    10. };
    12. typedef struct QNode *Queue;
    14. Queue CreateQueue();
    15. bool IsFull(Queue Q);
    16. void AddQ(Queue Q, int X);
    17. bool IsEmpty(Queue Q);
    18. int Delete(Queue Q);
    20. int main(void)
    21. {
    22.     Queue Q;
    23.     Q = CreateQueue();
    24.     AddQ(Q,6);
    25.     printf("6入队\n");
    26.     AddQ(Q,5);
    27.     printf("5入队\n");
    28.     AddQ(Q,11);
    29.     printf("11入队\n");
    30.     printf("%d出队\n",Delete(Q));
    31.     printf("%d出队\n",Delete(Q));
    32.     printf("%d出队\n",Delete(Q));
    33.     if(IsEmpty(Q))
    34.     {
    35.     printf("队空");
    36.     }    
    37.     return 0;
    38. } 
    41. Queue CreateQueue()
    42. {
    43.     Queue Q;
    44.     Q = (Queue)malloc(sizeof(struct QNode));
    45.     Q->rear = -1;
    46.     Q->front = -1;
    47.     return Q;
    48. }
    50. bool IsFull(Queue Q)
    51. {
    52.     return ((Q->rear + 1) % MaxSize == Q->front);
    53. }
    55. void AddQ(Queue Q, int X)
    56. {
    57.     if(IsFull(Q))
    58.     {
    59.     printf("已满");
    60.     return ;
    61.     }
    62.     else
    63.     {
    64.         Q->rear = ((Q->rear) + 1) % MaxSize;
    65.         Q->Data[Q->rear] = X;
    66.     }
    67. }
    69. bool IsEmpty(Queue Q)
    70. {
    71.     return (Q->front == Q->rear);
    72. }
    74. int Delete(Queue Q)
    75. {
    76.     if(IsEmpty(Q))
    77.     {
    78.     printf("队空");
    79.     return -1; 
    80.     }
    81.     else
    82.     {
    83.         Q->front = (Q->front + 1) % MaxSize;
    84.         return Q->Data[Q->front]; 
    85.     }
    86.  }

    2.队列链式存储

    1. #include <stdio.h>
    2. #include <stdlib.h>
    4. struct Node
    5. {
    6.     int Data;
    7.     struct Node *Next;
    8. };
    10.  struct QNode 
    11. {
    12.      struct Node *front;
    13.      struct Node *rear;
    14. }; 
    15.  typedef struct QNode *Queue; 
    17. Queue CreateQueue();
    18. bool IsEmpty(Queue Q);
    19. int Delete(Queue Q);
    20. void AddQ(Queue Q, int X);
    22. int main(void)
    23. {
    24.     Queue Q;
    25.     Q = CreateQueue();
    26.     printf("入队6\n"); 
    27.     AddQ(Q,6);
    28.     printf("入队7\n"); 
    29.     AddQ(Q,7);
    30.     printf("入队8\n"); 
    31.     AddQ(Q,8);
    32.     printf("出队%d\n",Delete(Q));
    33.     printf("出队%d\n",Delete(Q));
    34.     printf("出队%d\n",Delete(Q));
    35.     return 0;
    36.     free(Q);
    37. } 
    39. Queue CreateQueue()
    40. {
    41.     Queue Q;
    42.     Q = (Queue)malloc(sizeof(struct QNode));
    43.     Q->front = NULL;
    44.     Q->rear = NULL;
    45. }
    47. bool IsEmpty(Queue Q)
    48. {
    49.      return (Q->front == NULL);
    50. }
    54. int Delete(Queue Q)
    55. {
    56.     struct Node *Frontcell;
    57.     int FrontElem;
    58.     if  ( IsEmpty(Q) ) 
    59.     {
    60.         printf("队列空");
    61.         return -1;
    62.     }
    63.     else
    64.     {
    65.     Frontcell = Q->front;
    66.     if(Q->front == Q->rear)
    67.     { 
    68.         Q->front = NULL;
    69.         Q->rear = NULL; 
    70.     }
    71.     else
    72.     {
    73.     Q->front = Q->front->Next;
    74.     }
    75.     FrontElem = Frontcell->Data;
    76.     free(Frontcell);
    77.     return FrontElem;
    78.     }
    79. }
    81. void AddQ(Queue Q, int X)
    82. {
    83.     struct Node *New;
    84.     New = (struct Node*)malloc(sizeof(struct Node));
    85.     New->Data = X;
    86.     New->Next = NULL;
    87.     if(Q->rear == NULL)
    88.     {
    89.         Q->front = New;
    90.         Q->rear = New;
    91.     }
    92.     else
    93.     {
    94.         Q->rear->Next = New;
    95.         Q->rear = New;
    96.     }
    97. }