手写队列、栈

近视未看清

于 2021-09-10 16:18:52 发布

阅读量276

点赞数

CC 4.0 BY-SA版权

分类专栏：算法很美文章标签：数据结构

本文链接：https://blog.youkuaiyun.com/weixin_46165788/article/details/120224563

算法很美专栏收录该内容

42 篇文章

订阅专栏

本文介绍了数据结构中队列和栈的实现，包括链表节点的定义，以及基于链表实现的队列和栈的详细操作如入队、出队、压栈、弹栈等。队列采用双端操作，栈则遵循后进先出的原则。这些基本数据结构在编程中有着广泛的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

//链表节点
struct Node{
    int val;
    struct Node* next;
};

//队列
class queue{
private:
    struct Node* top; //取数据端
    struct Node* rear;	//放数据端
    int count; //元素个数计数器
public:
    queue(){
        rear = new struct Node;
        rear->next = NULL;
        top = rear;
        count = 0;
    }
    void push_back(int n){
        rear->val = n;
        rear->next = new struct Node;
        rear = rear->next;
        rear->next = NULL;
        count++;
    }
    int front(){
        return top->val;
    }
    void pop(){
        struct Node *temp = top;
        top = top->next;
        count--;
        delete temp;
    }
    int size(){
        return count;
    }
    bool empty(){
        return count==0;
    }
    ~queue(){
        while(top!=NULL){
            struct Node* temp = top;
            top = top->next;
            delete temp;
        }
    }
};


//栈
class stack{
private:
    struct Node *p; //栈顶
    int count;	//元素个数计数器
public:
    stack(){
        p = new struct Node;
        p->next = NULL;
        count = 0;
    }
    void push(int n){
        p->val = n;
        struct Node *pt = new struct Node;
        pt->next = p;
        p = pt;
        count++;
    }
    int top(){
        return p->next->val;
    }
    void pop(){
        struct Node *pt = p->next;
        p->next = pt->next;
        delete pt;
        count--;
    }
    int size(){
        return count;
    }
    bool empty(){
        return count==0;
    }
    ~stack(){
        struct Node *pt = NULL;
        while(p!=NULL){
            pt = p;
            p = p->next;
            delete pt;
        }
    }
};