数据结构与算法分析——c语言描述 练习3.26 答案
很水的题。终于把第三章的课后习题答案写完了,还是有点小激动的。
deque.h
typedef int ElementType;
#ifndef _Queue_h
#define _Queue_h
struct DequeRecord;
typedef struct DequeRecord *Deque;
int isEmpty(Deque q);
int isFull(Deque q);
Deque createDeque(int maxElements);
void disposeDeque(Deque q);
void makeEmpty(Deque q);
void Push(ElementType X, Deque D);
ElementType Pop(Deque D);
void Inject(ElementType X, Deque D);
ElementType Eject(Deque D);
#endif
deque.c
#include"deque.h"
#include"fatal.h"
#include<stdlib.h>
#define MinQueueSize (5)
struct DequeRecord {
int capacity;
int front;
int rear;
int size;
ElementType *array;
};
int isEmpty(Deque q) {
return q->size == 0;
}
int isFull(Deque q) {
return q->size == q->capacity;
}
Deque createDeque(int ma