005 -- DuLinkList_add nodes, delete node, Caser print..

最新推荐文章于 2022-10-18 16:44:19 发布

weixin_33852020

最新推荐文章于 2022-10-18 16:44:19 发布

阅读量69

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Shareishappy/p/7545169.html

本文介绍了一个使用双向链表实现字母循环的功能。通过初始化双向链表并填充26个英文字母，用户可以输入一个整数来决定字母序列的偏移量。该程序能够根据用户输入正向或负向移动字母顺序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

000-- define a Dulinklist

A empty DuLinklist:

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

Add a new Node

s->next = p;    
s->prior = p->prior;    
p->prior->next = s;    
p->prior = s;

Delete a Node

p->prior->next = p->next;
p->next->prior = p->prior;    
free(p);

print A-Z with the defined sequence by user

e.g. user input 3

then should be DEFG....ZABC

user input -3

then should be XYZABCEFG.....W

#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;

Status InitList(DuLinkList *L)
{
    DualNode *p,*q;
    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; //the last Node points to the first Node
    (*L)->next->prior = p; //set the first Node with data 'A' as head Node
    
    return OK;
}


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

int main()
{
    DuLinkList L;
    int i n;
    InitList(&L);
    printf("Please input a integer: \n");
    scanf("%d", &n);
    printf("\n");
    
    caser(&L,n);
    
    for(i=0;i<26;i++)
    {
        L = L->next;
        printf("%c", L->data);
        
    }
    
    printf("\n");
    
    return 0;
}