seqqueue.cpp

来自「农夫过河的扩展」· C++ 代码 · 共 33 行

#include"SeqQueue.h"
#include<iostream.h>
#include<assert.h>

SeqQueue::SeqQueue(){
	f = 0;r = 0;
}

int SeqQueue::isEmptyQueue(){
	return(f==r);
}

void SeqQueue::enQueue(int x){
	if (r+1%MaxNum == f)
		cout<<"Full queue!!\n";
	else{
		q[r] = x;
		r = (r+1) % MaxNum;
	}
}

void SeqQueue::deQueue(){
	if (isEmptyQueue())
		cout<<"Empty queue!!\n";
	else
		f = (f+1)%MaxNum;
}

int SeqQueue::frontQueue(){
	assert(!isEmptyQueue());
	return q[f];
}