数据结构--队列

创建队列

#include <stdio.h>
#include <stdlib.h>

typedef struct Queue{
    int head,tail,length;
    int *data;
}Queue;

void init(Queue *q,int length){
    q->data = (int *)malloc(sizeof(int) * length);
    q->length = length;
    q->head = 0;
    q->tail = -1;
}

void clear(Queue *q){
    free(q->data);
    free(q);
}

int main(){
    Queue *queue = (Queue *)malloc(sizeof(Queue));
    init(queue,1000);
    clear(queue);
}

加入队列

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define SUCCESS 1

typedef struct Queue{
    int *data;
    int head,tail,length;
}Queue;


void init(Queue *q,int length){
    q->data = (int *)malloc(sizeof(int) * length);
    q->length = length;
    q->head = 0;
    q->tail = -1;
}

void clear(Queue *q){
    free(q->data);
    free(q);
}

int push(Queue *q,int element){
    if(q->tail + 1 >= q->length){
        return ERROR;
    }
    q->tail++;
    q->data[q->tail] = element;
    return SUCCESS;
}

int main(){
    Queue *queue = (Queue *)malloc(sizeof(Queue));
    init(queue,100);
    for(int i = 1; i <= 10; i++){
        push(queue,i);
    }
    clear(queue);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Queue{
    int *data;
    int head,tail,length;
}Queue;

void init(Queue *q, int length){
    q->data = (int *)malloc(sizeof(int) * length);
    q->length = length;
    q->head = 0;
    q->tail = -1;
}

void clear(Queue *q){
    free(q->data);
    free(q);
}

int push(Queue *q,int element){
    if(q->tail +1 >= q->length ){
        return ERROR;
    }
    q->tail++;
    q->data[q->tail] = element;
    return OK;
}

void output(Queue *q){
    for(int i = q->head; i <= q->tail; i++){
        printf("%d",q->data);
    }
    printf("\n");
}

int main(){
    Queue *queue = (Queue *)malloc(sizeof(Queue));
    init(queue,1000);
    for(int i = 1; i <= 10; i++ ){
        push(queue,i);
    }
    output(queue);
    clear(queue);
    return 0;

}

查询首位，pop,空

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Queue {
    int *data;
    int head, tail, length;
}Queue;

void init(Queue *q, int length) {
    q->data = (int *)malloc(sizeof(int) * length);
    q->length = length;
    q->head = 0;
    q->tail = -1;
}

int push(Queue *q, int element) {
    if(q->tail + 1 >= q->length) {
        return ERROR;
    }
    q->tail++;
    q->data[q->tail] = element;
    return OK;
}

void output(Queue *q) {
    for (int i = q->head; i <= q->tail; i++) {
        printf("%d ", q->data[i]);
    }
    printf("\n");
}

// 请在下面实现队首元素输出函数 front
int front(Queue *q){
    return q->data[q->head];
}

// 请在下面实现删除队首元素函数 pop
void pop(Queue *q){
    q->head++;
}


// 请在下面实现判断队列是否为空的函数 empty
int empty(Queue *q){
 	return q->head > q->tail;
}


void clear(Queue *q) {
    free(q->data);
    free(q);
}

int main() {
    Queue *queue = (Queue *)malloc(sizeof(Queue));
    init(queue, 100);
    for (int i = 1; i <= 10; i++) {
        push(queue, i);
    }
    output(queue);
    if(!empty(queue)){
        printf("%d\n",front(queue));
        pop(queue);
    }
    output(queue);
    clear(queue);
    return 0;
}

循环队列入队和遍历

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Queue {
    int *data;
    int head, tail, length,count;
} Queue;

void init(Queue *q, int length) {
    q->data = (int *)malloc(sizeof(int) * length);
    q->length = length;
    q->head = 0;
    q->tail = -1;
    q->count = 0;
}

int push(Queue *q, int element) {
    if(q->count >= q->length) {
        return ERROR;
    }
    q->tail = (q->tail + 1) % q->length;
    q->data[q->tail] = element;
    q->count++;
    return OK;
    
}

void output(Queue *q) {
    int i = q->head;
  	do{
        printf("%d ",q->data[i]);
        i = (i + 1) % q->length;
    }while(i != (q->tail + 1) % q->length);
    printf("\n");
}

void clear(Queue *q) {
    free(q->data);
    free(q);
}

int main() {
    Queue *queue = (Queue *)malloc(sizeof(Queue));
    init(queue, 100);
    for (int i = 1; i <= 10; i++) {
        push(queue, i);
    }
    output(queue);
    clear(queue);
    return 0;
}

循环队列出队

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Queue {
    int *data;
    int head, tail, length, count;
}Queue;

void init(Queue *q, int length) {
    q->data = (int *)malloc(sizeof(int) * length);
    q->length = length;
    q->head = 0;
    q->tail = -1;
    q->count = 0;
}

int push(Queue *q, int element) {
    if (q->count >= q->length) {
        return ERROR;
    }
    q->tail = (q->tail + 1) % q->length;
    q->data[q->tail] = element;
    q->count++;
    return OK;
}

void output(Queue *q) {
    int i = q->head;
    do {
        printf("%d ", q->data[i]);
        i = (i + 1) % q->length;
    } while(i != (q->tail + 1) % q->length);
    printf("\n");
}

int front(Queue *q) {
    return q->data[q->head];
}

void pop(Queue *q) {
    q->head = (q->head + 1) % q->length;
    q->count--;
}

int empty(Queue *q) {
    return q->count == 0;
}

void clear(Queue *q) {
    free(q->data);
    free(q);
}

int main() {
    Queue *q = (Queue *)malloc(sizeof(Queue));
    init(q, 100);
    for (int i = 1; i <= 10; i++) {
        push(q, i);
    }
    output(q);
    if (!empty(q)) {
        printf("%d\n", front(q));
        pop(q);        
    }
    output(q);
    clear(q);
    return 0;
}