Exercises3.3 E7
2013-08-29 17:16
323 查看
E7.重新编写课本中队列处理的方法,使用一个标志而不是保持对了中元素个数的计数来指示满队列。
enum Error_code{success,overflow,underflow};
typedef int Queue_entry
const int maxqueue = 10;
class Queue
{
public:
Queue();
bool empty() const;
Error_code serve();
Error_code append(const Queue_entry item);
Error_code retrieve(Queue_entry item) const;
protected:
int front,rear;
Queue_entry entry[maxqueue];
bool flag; //¿Õʱ flag=1 ·Ç¿Õʱ flag=0
};
Queue::Queue()
{
rear = mmaxqueue-1;
front = 0;
flag = true;
}
bool Queue::empty()const
{
return flag;
}
Error_code Queue::append(const Queue_entry item)
{
if(!empty()&&(rear+1)%maxqueue == front) //empty:(rear+1)%maxqueue == front
retrun overflow;
flag = false;
rear= (rear+1)%maxqueue;
entry[rear] = item;
return success;
}
Error_code Queue::serve()
{
if(empty())
return underflow;
if(rear == front)
flag = true;
front = ((front+1) == maxqueue?0:(front+1));
return success;
}
Error_code Queue::retrieve(Queue_entry item) const
{
if(empty())
return underflow;
item = entry[front];
return success;
}
enum Error_code{success,overflow,underflow};
typedef int Queue_entry
const int maxqueue = 10;
class Queue
{
public:
Queue();
bool empty() const;
Error_code serve();
Error_code append(const Queue_entry item);
Error_code retrieve(Queue_entry item) const;
protected:
int front,rear;
Queue_entry entry[maxqueue];
bool flag; //¿Õʱ flag=1 ·Ç¿Õʱ flag=0
};
Queue::Queue()
{
rear = mmaxqueue-1;
front = 0;
flag = true;
}
bool Queue::empty()const
{
return flag;
}
Error_code Queue::append(const Queue_entry item)
{
if(!empty()&&(rear+1)%maxqueue == front) //empty:(rear+1)%maxqueue == front
retrun overflow;
flag = false;
rear= (rear+1)%maxqueue;
entry[rear] = item;
return success;
}
Error_code Queue::serve()
{
if(empty())
return underflow;
if(rear == front)
flag = true;
front = ((front+1) == maxqueue?0:(front+1));
return success;
}
Error_code Queue::retrieve(Queue_entry item) const
{
if(empty())
return underflow;
item = entry[front];
return success;
}
相关文章推荐
- Exercises 3.3 E7
- 《数据结构与程序设计---c++语言描述》Exercises3.3--E7
- Exercises 3.3 E7
- Exercises 3.3 E7
- Exercises 3.3 E7
- Exercises 3.3 E7
- Exercises3.3 E7
- Exercises 3.3 E7
- Exercises 3.3 E7
- Chapter3 Exercises3.3 E7
- 3.3 E7
- HOMEWORK exercise3.3 E7
- 3.3 E7
- exercises3.3
- 数据结构与程序设计 练习3.3 E7
- 习题3.3 E7
- 3.3 E7
- 3.3 E7
- 3.3 E7
- Exercise 3.3 E7