C++实现栈和队列

本文主要是介绍C++实现栈和队列，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

C++实现栈，可运行代码。

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


#define ALLOC_SIZE 512

typedef int KEY_TYPE;

typedef struct _stack {

    KEY_TYPE *base;
    int top;
    int stack_size;
    
} stack;


void init_stack(stack *s) {

    s->base = (KEY_TYPE*)calloc(ALLOC_SIZE, sizeof(KEY_TYPE));
    assert(s->base);

    s->top = 0;
    s->stack_size = ALLOC_SIZE;

}

void destroy_stack(stack *s) {

    assert(s);

    free(s->base);
    s->base = NULL;
    s->stack_size = 0;
    s->top = 0;

}

void push_stack(stack *s, KEY_TYPE data) {

    assert(s);

    if (s->top >= s->stack_size) {
        s->base = realloc(s->base, (s->stack_size + ALLOC_SIZE) * sizeof(KEY_TYPE));
        assert(s->base);

        s->stack_size += ALLOC_SIZE;
    }

    s->base[s->top] = data;
    s->top ++;
}

void pop_stack(stack *s, KEY_TYPE *data) {

    assert(s);

    *data = s->base[--s->top];

}

int empty_stack(stack *s) {
    return s->top == 0 ? 0 : 1; 
}

int size_stack(stack *s) {
    return s->top;
}

int main() {

    stack s;

    init_stack(&s);

    int i = 0;
    for (i = 0;i < 1000;i ++) {
        push_stack(&s, i+1);
    }

    while (empty_stack(&s)) {
        int data;

        pop_stack(&s, &data);
        printf("%4d", data);
    }
    printf("\n");

    destroy_stack(&s);

}

C++实现队列，可运行代码。

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


#define ALLOC_SIZE 512

typedef int KEY_TYPE;

typedef struct _queue_node {

    struct _queue_node *next;
    KEY_TYPE key;

} queue_node;

typedef struct _queue {

    queue_node *front;
    queue_node *rear;

    int queue_size;
    
} queue;

void init_queue(queue *q) {

    q->front = q->rear = NULL;
    q->queue_size = 0;
}

void destory_queue(queue *q) {

    queue_node *iter;
    queue_node *next;

    iter = q->front;

    while (iter) {
        next = iter->next;
        
        free(iter);
        iter = next;
    }
    
}

void push_queue(queue *q, KEY_TYPE key) {

    assert(q);

    if (q->rear) {

        queue_node *node = (queue_node*)calloc(1, sizeof(queue_node));
        assert(node);

        node->key = key;
        node->next = NULL;

        q->rear->next = node;
        q->rear = node;
        
    } else {

        queue_node *node = (queue_node*)calloc(1, sizeof(queue_node));
        assert(node);

        node->key = key;
        node->next = NULL;

        q->front = q->rear = node;
        
    }
    q->queue_size ++;
}

void pop_queue(queue *q, KEY_TYPE *key) {

    assert(q);
    assert(q->front != NULL);

    if (q->front == q->rear) {
        *key = q->front->key;

        free(q->front);
        q->front = q->rear = NULL;
    } else {

        queue_node *node = q->front->next;

        *key = q->front->key;
        free(q->front);

        q->front = node;

    }
    q->queue_size --;
}

int empty_queue(queue *q) {

    assert(q);

    return q->rear == NULL ? 0 : 1;

}

int size_queue(queue *q) {

    return q->queue_size;

}

int main() {

    queue q;

    init_queue(&q);

    int i = 0;
    for (i = 0;i < 1000;i ++) {
        push_queue(&q, i+1);
    }

    while (empty_queue(&q)) {

        KEY_TYPE key;
        pop_queue(&q, &key);

        printf("%4d", key);
        
    }

    destory_queue(&q);

}

这篇关于C++实现栈和队列的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！