C++实现循环队列

一、队列的定义

class CirQueue
{
public:

	CirQueue(int len)
	{
		this->m_Array = new int[len] {};
		this->m_Front_idx = 0;
		this->m_Rear_idx = 0;
		this->m_Len = len;
	}

	void Push(int data);
	void Delete();
	void Print();

	~CirQueue()
	{
		if (this->m_Array != nullptr)
		{
			delete[] this->m_Array;
			this->m_Array = nullptr;
		}
	}

private:

	int* m_Array;
	int m_Front_idx;
	int m_Rear_idx;
	int m_Len;
};

二、插入

void CirQueue::Push(int data)
{
	if ((this->m_Rear_idx + 1) % this->m_Len == this->m_Front_idx)
	{
		cout << "队列已满,插入失败" << endl;
		return;
	}
	this->m_Array[this->m_Rear_idx] = data;
	this->m_Rear_idx = (this->m_Rear_idx + 1) % this->m_Len;
}

三、删除

void CirQueue::Delete()
{
	if (this->m_Front_idx == this->m_Rear_idx)
	{
		cout << "队列为空,删除失败" << endl;
		return;
	}
	this->m_Array[this->m_Front_idx] = 0;
	this->m_Front_idx = (this->m_Front_idx + 1) % this->m_Len;
}

四、整体展示

#include <iostream>

using namespace std;

class CirQueue
{
public:

	CirQueue(int len)
	{
		this->m_Array = new int[len] {};
		this->m_Front_idx = 0;
		this->m_Rear_idx = 0;
		this->m_Len = len;
	}

	void Push(int data);
	void Delete();
	void Print();

	~CirQueue()
	{
		if (this->m_Array != nullptr)
		{
			delete[] this->m_Array;
			this->m_Array = nullptr;
		}
	}

private:

	int* m_Array;
	int m_Front_idx;
	int m_Rear_idx;
	int m_Len;
};

void CirQueue::Push(int data)
{
	if ((this->m_Rear_idx + 1) % this->m_Len == this->m_Front_idx)
	{
		cout << "队列已满,插入失败" << endl;
		return;
	}
	this->m_Array[this->m_Rear_idx] = data;
	this->m_Rear_idx = (this->m_Rear_idx + 1) % this->m_Len;
}

void CirQueue::Delete()
{
	if (this->m_Front_idx == this->m_Rear_idx)
	{
		cout << "队列为空,删除失败" << endl;
		return;
	}
	this->m_Array[this->m_Front_idx] = 0;
	this->m_Front_idx = (this->m_Front_idx + 1) % this->m_Len;
}

void CirQueue::Print()
{
	for (int i = 0; i < this->m_Len - 1; ++i)
	{
		cout << this->m_Array[i] << " ";
	}
	cout << endl;
}

void Text()
{
	CirQueue CQ(5);
	CQ.Push(5);
	CQ.Push(2);
	CQ.Push(3);
	CQ.Push(4);
	CQ.Print();
	CQ.Delete();
	CQ.Print();
}

int main()
{
	Text();

	system("pause");
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值