zoukankan      html  css  js  c++  java
  • Queue class

    #pragma once
    #include <iostream>
    #include <iomanip>

    using namespace std;

    class Queue
    {
      struct Node
      {
        int a;
        Node *next;
      };

      public:
        Queue();
        void push(int b);
        void pop();
        int getlength();
        virtual void print();

      private:
        Node *head;
        Node *rear;
    };

    void Queue::push(int b)
    {
      Node *p1 = new Node;
      p1->a = b;
      p1 -> next = NULL;
      rear->next = p1;
      rear = p1;
      head->a++;
      cout << setw(2)<<b<<setw(2)<< "进入队列"<<endl;
    }

    void Queue::pop()
    {
      Node *p;
      p = head->next;
      cout << " "<<setw(2)<<p->a<<setw(2)<<"出队"<< endl;
      head->next = p->next;
      delete p;
      head->a--;
    }

    int Queue::getlength()
    {
      return head->a;
    }

    void Queue::print()
    {
      Node *p;
      p = head->next;
      cout << "队列中的元素"<< endl;
      while (p)
      {
        cout << p->a<< "->";
        p = p->next;
      }
      cout << "NULL"<< endl;
    }

    Queue::Queue()
    {
      rear = head = new Node();
    }

  • 相关阅读:
    JZOJ 5870 地图
    20190921
    20190919
    SP703 SERVICE
    UVA323 Jury Compromise
    [note]一类位运算求最值问题
    [BZOJ3674]可持久化并查集
    [luogu3359]改造异或树
    [luogu4755]Beautiful Pair
    [BJWC2012]冻结
  • 原文地址:https://www.cnblogs.com/herd/p/10969650.html
Copyright © 2011-2022 走看看