关于循环队列的队满与队空的条件都是front=rear,如何区分,对于这些问题,刚学习的我有一些简单的认识,希望大家能指正我的错误
设立一个tag标识再加上rear=front即可作为队满与队空的判断依据,在入队时tag=1,出队时tag=0,这样的话,当rear=front且tag=1时为队满,当tag=0且rear=front时为队空,代码如下
class SqQueueClass
{
const int maxsize = 50;
public string[] data;
public int front,rear;
public int tag = 0;
public SqQueueClass()
{
data = new string[maxsize];
front = rear = -1;
} public bool QueueEmpty()
{
return (front == rear && tag == 0);
}
public bool enQueue(string e)//进队
{
if (front == rear && tag == 1)
return false;
rear = (rear + 1) % maxsize;
data[rear] = e;
tag = 1;
return true;
}
public bool deQueue(ref string e)//出队
{
if (front == rear && tag == 0)
return false;
front = (front + 1) % maxsize;
e = data[front];
tag = 0;
return true;
}
}
static void Main(string[] args)
{
SqQueueClass L = new SqQueueClass();
bool p = false;
p = L.enQueue(“A”);
Console.WriteLine§;
p = L.enQueue(“B”);
Console.WriteLine§;
p = L.enQueue(“C”);
Console.WriteLine§;
p = L.enQueue(“D”);
Console.WriteLine§;
p = L.enQueue(“E”);
Console.WriteLine§;
string e = “”;
p = L.deQueue(ref e);
Console.WriteLine§;
Console.WriteLine(e);
Console.ReadKey();
}
关于设置tag的方法而言相较于传统的留出一位的存储空间而言,减少对内存资源的占用,不用浪费内存。
关于栈的一些简单描述
最新推荐文章于 2022-03-27 16:07:45 发布