3-1 Deque —2022秋.3.6-7

题目：

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的定义方式那里费了时间，好在最后有了自己的理解(仅仅是自己好理解，Front指向的是空，它的下一个才是存有element的第一个，而Rear指向的确实是最后一个存有element的)，不过本题除了是英文之外（我觉得别急的用APP翻译，自己翻译也很简单的），思路很简单，我第一次测试没通过是在pop()函数，并未考虑到D->Front->Next==D->Rear的情况。

代码实现：

Deque CreateDeque(){
    PtrToNode p=(PtrToNode)malloc(sizeof(struct Node));
   /* p->Last=NULL;
    p->Next=NULL;*/
    Deque q=(Deque)malloc(sizeof(struct DequeRecord));
    q->Front=q->Rear=p;
    return q;
}

int Push( ElementType X, Deque D )
{
    PtrToNode p=(PtrToNode)malloc(sizeof(struct Node));
    p->Element=X;
    if(D->Front==D->Rear)
    {
        D->Front->Next=p;
        D->Rear=p;
        p->Last=D->Front;
    }
    else
    {
        p->Next=D->Front->Next;
        D->Front->Next=p;
        p->Last=D->Front;
        p->Next->Last=p;
    }
    return 1;
}

ElementType Pop( Deque D )
{
    if(D->Front==D->Rear)
        return ERROR;
    else
    {
        PtrToNode p=D->Front->Next;
        ElementType x=p->Element;
        if(p!=D->Rear)
        {
            D->Front->Next=p->Next;
             p->Next->Last=D->Front->Next;
        }
        else if(p==D->Rear)
        {
            D->Rear=D->Front;
        }
         //free(p);
         return x;
    }
}

int Inject( ElementType X, Deque D )
{
    PtrToNode p=(PtrToNode)malloc(sizeof(struct Node));
    p->Element=X;
    if(D->Front==D->Rear)
    {
        D->Rear=p;
        D->Front->Next=p;
        p->Last=D->Front;
       // p->Next=NULL;
    }
    else
    {
        D->Rear->Next=p;
        p->Last=D->Rear;
        D->Rear=p;
       // p->Next=NULL;
    }
    return 1;
}

ElementType Eject( Deque D )
{
    if(D->Front==D->Rear)
        return ERROR;
    else
    {
        PtrToNode p=D->Rear;
        ElementType x=p->Element;
        D->Rear=p->Last;
       // D->Rear->Next=NULL;
        return x;
    }
}