题目
- 要求实现用户输入一个数使得26个字母排列发生变化,如用户输入3则输出结果:DEFGHIJKLMNOPQRSTUVWXYZABC;用户输入-3则输出结果:XYZABCDEFGHIJKLMNOPQRSTUVW
//============================================================================
// Name : InsertSort.cpp
// Author : YL
// Version :
//============================================================================
#include <iostream>
#include <string>
#define Error 0
#define OK 1
using namespace std;
typedef char Elemtype;
typedef int Status;
typedef struct DualNode
{
Elemtype data;
struct DualNode *prior;
struct DualNode *next;
}DualNode, *DualLinkList;
Status Init(DualLinkList *L)
{
DualNode *p, *q;
int i;
*L = (DualNode *)malloc(sizeof(DualNode));
if(!(*L)) return Error;
(*L)->prior = (*L)->next = NULL;
p = *L;
for (i =0; i<26; i++)
{
q = (DualNode *)malloc(sizeof(DualNode));
if(!(q)) return Error;
q->data = 'A'+i;
//注意用(p),不要用(*L)
q->next = p->next;
q->prior = p;
p->next = q;
p = q;
}
p->next = (*L)->next;
(*L)->next->prior = p;
return OK;
}
void Caeser(DualLinkList *L, int i)
{
if(i>0)
{
do
{
(*L) = (*L)->next;
}while(--i);
}
if(i<0)
{
do
{
(*L) = (*L)->prior;
}while(++i);
}
}
int main()
{
DualLinkList L;
int n;
Init(&L);
printf("初始化字段:\n");
for (int i = 0; i<26;i++)
{
L = L->next;
printf("%c",L->data);
}
printf("\n");
cin >>n ;
Caeser(&L,n);
printf("操作后字段:\n");
for (int i = 0; i<26;i++)
{
L = L->next;
printf("%c",L->data);
}
return 0;
}
//输出结果
//
//初始化字段:
//ABCDEFGHIJKLMNOPQRSTUVWXYZ
//3
//操作后字段:
//DEFGHIJKLMNOPQRSTUVWXYZABC
//
//初始化字段:
//ABCDEFGHIJKLMNOPQRSTUVWXYZ
//-5
//操作后字段:
//VWXYZABCDEFGHIJKLMNOPQRSTU
核心思路解析(图片)