Implement a queue class.
Utilisateur anonyme
class ListNode { public: int val; ListNode* next; ListNode(){val=0;next=NULL;} ListNode(int v){val=v;next=NULL;} }; class Queue { public: void enqueue(int v); int dequeue(); private: ListNode* head; ListNode* tail; } void Queue::enqueue(int v){ if(head == NULL){ head = new ListNode(v); tail = head; } else{ tail->next = new ListNode(v); tail = tail->next; } } int Queue::dequeue(){ assert(head!= NULL); int ret = head->val; ListNode* temp = head; head = head->next; delete temp; return ret; }