数据结构（2）----队列

队列queue

　　原则：先进先出 后进后出

#include "queue.h"
/*
typedef int T;

typedef struct Queue{
    T *m_vect;    //存储数据的内存空间
    size_t cap;   //总容量
    size_t index; //队列头的下标位置
    size_t size;  //目前元素的个数
}Queue;
*/
//初始化队列 申请动态内存
void init(Queue *que,size_t cap){
    que->m_vect = calloc(cap,sizeof(T));
    que->cap = cap;
    que->index = 0;
    que->size = 0;
}
//队列是否为空
bool isEmpty(Queue *que){
    return que->size == 0;    
}
//队列是否已满
bool isFull(Queue *que){
    return que->size == que->cap;    
}
//容量大小
size_t getCap(Queue *que){
    return que->cap;    
}
//已经存储的元素个数
size_t getSize(Queue *que){
    return que->size;    
}
//压入一个元素 //需要判断队列有没有满
void push(Queue *que,T data){
    que->m_vect[(que->index+que->size)%que->cap] = data;
    ++que->size;
}
//弹出一个元素  //需要判断队列还有没有元素
T pop(Queue *que){
    T data = que->m_vect[que->index];
    que->index = (que->index+1)%que->cap;
    --que->size;
    return data;
}
//指向头元素
T peekFront(Queue *que){
    return que->m_vect[que->index];    
}
//指向尾元素
T peekTail(Queue *que){
    return que->m_vect[(que->index+que->size-1)%que->cap];    
}
//遍历元素
void travel(Queue *que){
    for(int i=0;i<que->size;i++){
        printf("%d ",que->m_vect[(i+que->index)%que->cap]);
    }    
    printf("
");
}
//清空元素
void clear(Queue *que){
    while(!isEmpty(que)){
        pop(que);    
    }
    //que->index = 0;
    //que->size = 0;
}
//销毁队列
void destroy(Queue *que){
    if(que->m_vect != NULL){
        free(que->m_vect);
        que->m_vect = NULL;
    }
}

双端队列deque

　　原则：队列两端 都可以进出

#include "deque.h"
/*
typedef int T;

typedef struct Deque{
    T *m_vect;    //存储元素的内存空间
    size_t cap;   //总容量
    size_t size;  //当前元素的个数
    size_t index; //队首的位置
    
}Deque;
*/
//初始化队列 申请动态内存
void init(Deque *deq,size_t cap){
    deq->m_vect = calloc(cap,sizeof(T));    
    deq->cap = cap;
    deq->size = 0;
    deq->index = 0;
}
//销毁队列
void destroy(Deque *deq){
    if(deq->m_vect != NULL){
        free(deq->m_vect);
        deq->m_vect = NULL;
    }    
}
//判断是否为空
bool isEmpty(Deque *deq){
    return deq->size == 0;    
}
//判断是否已满
bool isFull(Deque *deq){
    return deq->cap == deq->size;    
}
//容量
size_t getCap(Deque *deq){
    return deq->cap;    
}
//当前元素的个数
size_t getSize(Deque *deq){
    return deq->size;    
}
//从头部压入元素
void pushHead(Deque *deq,T data){
    /*
    if(deq->index==0){
        deq->index = deq->cap-1;    
    }else{
        --deq->index;    
    }*/
    deq->index = deq->index==0?deq->cap-1:deq->index-1;
    deq->m_vect[deq->index] = data;
    ++deq->size;
}
//从尾部压入元素
void pushTail(Deque *deq,T data){
    deq->m_vect[(deq->size+deq->index)%deq->cap] = data;
    ++deq->size;
}
//从头部弹出元素
T popHead(Deque *deq){
    T data = deq->m_vect[deq->index];
    deq->index = (deq->index+1)%deq->cap;
    --deq->size;
    return data;
}
//从尾部弹出元素
T popTail(Deque *deq){
    T data = deq->m_vect[(deq->size+deq->index-1)%deq->cap];    
    --deq->size;
    return data;//return deq->m_vect[(--deq->size+deq->index)%deq->cap];
}
//指向队列头部
T peekHead(Deque *deq){
    return deq->m_vect[deq->index];    
}
//指向队列尾部
T peekTail(Deque *deq){
    return deq->m_vect[(deq->index+deq->size-1)%deq->cap];    
}
//遍历元素
void travel(Deque *deq){
    for(int i=0;i<deq->size;i++){
        printf("%d ",deq->m_vect[(deq->index+i)%deq->cap]);    
    }    
    printf("
");
}
//清空队列
void clear(Deque *deq){
    while(!isEmpty(deq)){
        popTail(deq);
    }    
    //deq->size = 0;
    //deq->index = 0;
}