数据结构(双向循环链表)

问题

abcd...26个字母，
控制台输入3，
则显示defghijklmnopqrstuvwxyzabc，
控制台输入-3
则显示xyzabcdefghijklmnopqrstuvw

使用双向链表实现的代码如下:

#include <stdio.h>
#include <stdlib.h>

#define OK    1
#define ERROR 0

typedef char ElemType;
typedef int  Status;

typedef struct DualNode
{
    ElemType data;
    struct DualNode *prior;
    struct DualNode *next;
}DualNode,*DuLinkList;

/*初始化26个字母链接的双向环型链表*/
Status InitList(DuLinkList *L)
{
    DualNode *p, *q;
    DualNode *temp;
    int i;

    *L = (DuLinkList)malloc(sizeof(DualNode));
    if(!(*L))
    {
        return ERROR;
    }

    (*L)->next = (*L)->prior = NULL;

    p = (*L);

    for(i=0; i<26; i++)
    {
        q = (DualNode*)malloc(sizeof(DualNode));
        if(!q)
        {
            return ERROR;
        }
        q->data = 'A'+i;
        q->prior = p;
        q->next = p->next;
        p->next = q;

        p = q;
    }

    p->next = (*L)->next;
    (*L)->next->prior = p;

    temp = *L;

    *L = p->next;
    free(temp);
    return OK;
}

void Caesar(DuLinkList *L, int i)
{
    if(i>0)
    {
        do 
        {
            (*L) = (*L)->next;
        } while(--i);
    }

    if(i < 0)
    {
        do 
        {
            (*L) = (*L)->prior;
        } while(++i);
    }
}


int main()
{
    DuLinkList L;
    int i;
    int n;

    printf("请输入一个整数:");
    scanf("%d",&n);
    printf("\n");
    InitList(&L);
    Caesar(&L, n);

    for(i=0; i<26; i++)
    {
        printf("%c",L->data);
        L = L->next;
    }
    printf("\n");
    return 0;
}