队列另一种实现（链表）

最新推荐文章于 2025-04-30 08:58:34 发布

hongjunbj

最新推荐文章于 2025-04-30 08:58:34 发布

阅读量543

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/hongjunbj/article/details/19628381

算法专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种基于链表实现的队列数据结构，并详细解释了队列的基本操作，包括入队(push)、出队(pop)和获取队首元素(getFront)等。此外，还提供了完整的C++代码实现，展示了如何在实际应用中使用该队列。

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

头文件

typedef struct Node
{
	int val;
	Node *next;
	Node(){next=NULL;}
	Node(int v)
	{
		val = v;
		next = NULL;
	}
}Node;

class QueueList
{
public:
	QueueList(int max);
	~QueueList();
	int pop();
	void push(int x);
	int getFront() const;
	int count();

private:
	int m_count;
	int m_max;
	Node* m_head;
	Node* m_tail;
};

cpp

#include "Queue_list.h"

int QueueList::getFront()const
{
	if(m_count<=0)
	{
		throw "QueueList is empty";
		return -1;
	}
	else
	{
		return m_head->val;
	}
}

int QueueList::pop()
{
	if(m_count<=0)
	{
		throw "QueueList is empty";
		return -1;
	}
	else
	{
		m_count--;
		int tmp = m_head->val;
		Node *node = m_head;
		m_head = m_head->next;
        delete node;
        if(m_head==NULL)
        {
            m_tail = NULL;
        }
		return tmp;
	}
}

void QueueList::push(int x)
{
	if(m_count>=m_max)
	{
		throw "QueueList is full";
	}
	else
	{
		Node * node = new Node(x);
		if(m_head == NULL)
		{
			m_head = node;
			m_tail = node;
		}
		else
		{
			m_tail->next = node;
			m_tail = node;
		}
		m_count++;
	}
}

QueueList::QueueList(int max):m_count(0),m_head(0),m_tail(0),m_max(max)
{

}

QueueList::~QueueList()
{
	Node *node;
	while(m_head != NULL)
	{
		node = m_head->next;
		delete m_head;
		m_head = node;
	}
}

int QueueList::count()
{
	return m_count;
}