循环队列的简单实现

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#define maxn  20
#define add_length 5
using namespace std;
typedef struct Node{
    int rear;
    int front;
    int size;
    int *data;
}*LoopQueue;

void Init(LoopQueue &Q) {
    Q->rear = Q->front = 0;
    Q->data = (int *) malloc(sizeof(int) * maxn);
    Q->size = maxn;
}

void put(LoopQueue &Q, int value) {
    int pos = (Q->front + 1) % Q->size;
    if(pos == Q->rear) {
        return;
    }
    Q->data[pos] = value;
    Q->front = pos;
    printf("front :%d rear : %d value:%d\n",Q->front,Q->rear,value);
}

void pop(LoopQueue &Q, int &e) {
    if(Q->front == Q->rear) {
        return ;
    }
    e = Q->data[Q->rear];
    Q->rear = (Q->rear + 1) %  Q->size;
    printf("front :%d rear : %d value:%d\n",Q->front,Q->rear,e);
}

void destory(LoopQueue Q) {
    Q->front = Q->rear = Q->size = 0;
    free(Q->data);
}

int main() {
    LoopQueue Q = (LoopQueue) malloc(sizeof(LoopQueue));
    Init(Q);
    int e;
    for(int i = 1;i<=1000;i++) {
        put(Q,i);
    }
    for(int i = 1;i < 5;i++) {
        pop(Q,e);
    }
    for(int i= 1;i<50;i++) {
        put(Q,i + 100);
    }
    destory(Q);
    return 0;
}

     
     
    
    
   
   

循环链表简单实现用点访问

#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#define maxn  20
#define add_length 5
using namespace std;
typedef struct Node{
    int rear;
    int front;
    int size;
    int *data;
}LoopQueue;

void Init(LoopQueue &Q) {
    Q.rear = Q.front = 0;
    Q.data = (int *) malloc(sizeof(int) * maxn);
    Q.size = maxn;
}

void put(LoopQueue &Q, int value) {
    int pos = (Q.front + 1) % Q.size;
    if(pos == Q.rear) {
        return;
    }
    Q.data[pos] = value;
    Q.front = pos;
    printf("front :%d rear : %d value:%d\n",Q.front,Q.rear,value);
}

void pop(LoopQueue &Q, int &e) {
    if(Q.front == Q.rear) {
        return ;
    }
    e = Q.data[Q.rear];
    Q.rear = (Q.rear + 1) %  Q.size;
    printf("front :%d rear : %d value:%d\n",Q.front,Q.rear,e);
}

void destory(LoopQueue &Q) {
    Q.front = Q.rear = Q.size = 0;
    free(Q.data);
}

int main() {
    LoopQueue Q = LoopQueue{0,0,0,NULL};
    Init(Q);
    int e;
    for(int i = 1;i<=1000;i++) {
        put(Q,i);
    }
    for(int i = 1;i < 5;i++) {
        pop(Q,e);
    }
    for(int i= 1;i<50;i++) {
        put(Q,i + 100);
    }
    destory(Q);
    return 0;
}