A “deque” is a data structure consisting of a list of items, on which the following operations are possible:
Push(X,D): Insert item X on the front end of deque D.
Pop(D): Remove the front item from deque D and return it.
Inject(X,D): Insert item X on the rear end of deque D.
Eject(D): Remove the rear item from deque D and return it. Write routines to support the deque that take O(1) time per operation.
Format of functions:
Deque CreateDeque();
int Push( ElementType X, Deque D );
ElementType Pop( Deque D );
int Inject( ElementType X, Deque D );
ElementType Eject( Deque D );
where Deque is defined as the following:
typedef struct Node *PtrToNode;
struct Node {
ElementType Element;
PtrToNode Next, Last;
};
typedef struct DequeRecord *Deque;
struct DequeRecord {
PtrToNode Front, Rear;
};
Here the deque is implemented by a doubly linked list with a header. Front and Rear point to the two ends of the deque respectively. Front always points to the header. The deque is empty when Front and Rear both point to the same dummy header. Note: Push and Inject are supposed to return 1 if the operations can be done successfully, or 0 if fail. If the deque is empty, Pop and Eject must return ERROR which is defined by the judge program.
Sample program of judge:
#include <stdio.h>
#include <stdlib.h>
#define ElementType int
#define ERROR 1e5
typedef enum { push, pop, inject, eject, end } Operation;
typedef struct Node *PtrToNode;
struct Node {
ElementType Element;
PtrToNode Next, Last;
};
typedef struct DequeRecord *Deque;
struct DequeRecord {
PtrToNode Front, Rear;
};
Deque CreateDeque();
int Push( ElementType X, Deque D );
ElementType Pop( Deque D );
int Inject( ElementType X, Deque D );
ElementType Eject( Deque D );
Operation GetOp(); /* details omitted */
void PrintDeque( Deque D ); /* details omitted */
int main()
{
ElementType X;
Deque D;
int done = 0;
D = CreateDeque();
while (!done) {
switch(GetOp()) {
case push:
scanf("%d", &X);
if (!Push(X, D)) printf("Memory is Full!\n");
break;
case pop:
X = Pop(D);
if ( X==ERROR ) printf("Deque is Empty!\n");
break;
case inject:
scanf("%d", &X);
if (!Inject(X, D)) printf("Memory is Full!\n");
break;
case eject:
X = Eject(D);
if ( X==ERROR ) printf("Deque is Empty!\n");
break;
case end:
PrintDeque(D);
done = 1;
break;
}
}
return 0;
}
/* Your function will be put here */
Sample Input:
Pop
Inject 1
Pop
Eject
Push 1
Push 2
Eject
Inject 3
End
结尾无空行
Sample Output:
Deque is Empty!
Deque is Empty!
Inside Deque: 2 3
结尾无空行
代码展示:
//双向非循环链表
Deque CreateDeque()
{
Deque d=(Deque)malloc(sizeof(struct DequeRecord));
d->Front=(struct Node*)malloc(sizeof(struct Node));
d->Front->Last=NULL;
d->Front->Next=NULL;
d->Rear=d->Front;
return d;
}
int Push( ElementType X, Deque D )
{
PtrToNode p=(PtrToNode)malloc(sizeof(struct Node));
if(!p)
{
return 0;
}
p->Element=X;
if(D->Front->Next)//队列非空有存储数据的结点,对rear没有影响
{
D->Front->Next->Last=p;//原来的头结点下一个元素的前驱指向p
p->Next=D->Front->Next;//
p->Last=D->Front;
D->Front->Next=p;
}
else//头结点下一个为空,其实就是队列为空,这时候其实也要改变rear
{
p->Last=D->Front;
p->Next=NULL;
D->Front->Next=p;
D->Rear=p;
}
return 1;
}
ElementType Pop( Deque D )
{
int data;
if(D->Front==D->Rear)//队列为空
{
return ERROR;
}
PtrToNode p=D->Front->Next;
if(D->Front->Next==D->Rear)//只有一个元素
{
D->Front->Next=NULL;
D->Rear=D->Front;
}
else//有好多元素
{
D->Front->Next->Next->Last=D->Front;//前接头部
D->Front->Next=D->Front->Next->Next;//头部接下
}
data=p->Element;
free(p);
return data;
}
int Inject( ElementType X, Deque D )
{
PtrToNode r=(PtrToNode)malloc(sizeof(struct Node));
if(!r)
{
return 0;
}
r->Element=X;
r->Last=D->Rear;//前接尾巴
r->Next=NULL;
D->Rear->Next=r;
D->Rear=r;
return 1;
}
ElementType Eject( Deque D )
{
if(D->Front==D->Rear)
{
return ERROR;
}
PtrToNode p=D->Rear;
D->Rear=D->Rear->Last;
D->Rear->Next=NULL;
int data=p->Element;
free(p);
return data;
}