6-1 Deque PTA_Data Structures and Algorithms (English)

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 q = (Deque)malloc(sizeof(struct DequeRecord));
	PtrToNode p = (PtrToNode)malloc(sizeof(struct Node));
	p->Last = NULL;		//单独队头没有前节点
	p->Next = NULL;		//单独队头没有后节点
	q->Front = q->Rear = p;		//队头和队尾指向同一节点
	return q;
}
int Push(ElementType X, Deque D)
{
	PtrToNode p = (PtrToNode)malloc(sizeof(struct Node));
	if (p == NULL)
		return 0;
	p->Element = X;
	PtrToNode t = D->Front->Next;
	if (t == NULL)		//t为空，即插入第一个节点，队尾需要改变指向
	{
		D->Front->Next = p;
		p->Last = D->Front;
		D->Rear = p;
		return 1;
	}
	else		//t不为空，插入头节点不需要改变队尾指向
	{
		p->Last = D->Front;
		D->Front->Next = p;
		p->Next = t;
		t->Last = p;
		return 1;
	}
}
ElementType Pop(Deque D)
{
	if (D->Front == D->Rear) return ERROR;
	PtrToNode t = D->Front->Next;
	ElementType e = t->Element;
	if (t->Next == NULL)		//t的下一节点为空，即删除队列中的最后一个元素，需要改变队尾指向
	{
		D->Front->Next = NULL;
		D->Front->Last = NULL;
		D->Rear = D->Front;
	}
	else		//t不为空，不需要改变队尾指向
	{
		D->Front->Next = t->Next;
		t->Next->Last = D->Front;
		free(t);
		return e;
	}
}
//尾插和尾出较为简单，不需要判断是否改变队尾和队头指向
int Inject(ElementType X, Deque D)
{
	PtrToNode p = (PtrToNode)malloc(sizeof(struct Node));
	if (p == NULL) return 0;
	p->Element = X;
	D->Rear->Next = p;
	p->Last = D->Rear;
	p->Next = NULL;
	D->Rear = p;
	return 1;
}
ElementType Eject(Deque D)
{
	if (D->Front == D->Rear) return ERROR;
	PtrToNode p = D->Rear;
	D->Rear = p->Last;
	p->Last->Next = NULL;
	ElementType e = p->Element;
	free(p);
	return e;
}