c.rar_加密_文本加密

#include<iostream>//cin>> #include<string> #include<cstdio> #include<stdlib.h> #include<stdio.h> #include<time.h> #include<conio.h>//getch(); #define OK 1 #define ERROR 0 #define NULL 0 using namespace std; void OrderNode(); int Rand(); int InsetNode(); int FormNode(); int NumNode(); void FreeNode(); void Free(); void Cprint(); int OrderLength(); typedef long ElemType; typedef struct LNode { struct LNode *prior; long length; ElemType data; struct LNode *next; }LNode,*LinkList; /*随机数链表*/ int Rand() { int a=rand()%100+1; //cout<<a<<" "; return a; } /*申请结点并初始化*/ int InsetNode(LinkList &p) { if(p=(LinkList)malloc(sizeof(LNode))) { p->length=1; p->prior=NULL; p->next=NULL; return 1; } else { cout<<"没有足够的内存空间!"; return 0; } } /*数结点数*/ int NumNode(LinkList p) { if(p==NULL) return 0; LinkList q=p->next; int i; for(i=1;;i++) { if(q==p)break; q=q->next; } //cout<<endl<<"结点数:"<<i<<endl; return i; } /*输出结点*/ void Cprint(LinkList p) { if(p==NULL){cout<<"链表不存在!"<<endl;return;} int j; j=NumNode(p); cout<<endl; for(int i=1;i<=j;i++) { cout<<p->length<<","<<p->data<<" "; p=p->next; if(!(i%10)) cout<<endl; } return; } void Cout(LinkList p) { if(p==NULL){cout<<"链表不存在!"<<endl;return;} int j; j=NumNode(p); cout<<endl; LinkList q; q=p->prior; for(int i=1;i<=j;i++) { cout<<q->length<<","<<q->data<<" "; q=q->prior; } return; } /*删除单个结点;*/ void Free(LinkList &p,int A) { LinkList q; q=p; if(p==NULL){cout<<"链表不存在!"<<endl;return;} int a=NumNode(p); int b=p->prior->length;//未能确定最大链表结点数!!!! if(!A||A>b){cout<<"你要删除的结点不存在!"<<endl;return;} if(A==p->length) q=p->next; for(int i=1;i<=a;i++) { if(A==p->length) { p->prior->next=p->next; p->next->prior=p->prior; free(p); break; } p=p->next; } p=q; Cprint(p); return ; } /*排序(交换结点)*/ void OrderNode(LinkList &head,int A) { LinkList p,q,p1,t,t1; InsetNode(t1); t=t1; q=p1=head; p=head->next; int a=NumNode(head); if(!A) { for(int i=1;i<a;i++)//升序排列. { q=p1; p=p1->next; for(int j=a-i;j>=1;j--) { if((q->data)>(p->data)) { t->next=p->next; p->next=q; q->next=t->next; q->prior->next=p; p->prior=q->prior; t->next->prior=q; q->prior=p; t->length=p->length; p->length=q->length; q->length=t->length; t=p; p=q; q=t; if(j==a-i)p1=q; } t=t1; q=p; p=p->next; } } } else { for(int i=1;i<a;i++)//降序排列. { q=p1; p=p1->next; for(int j=a-i;j>=1;j--) { if((q->data)<(p->data)) { t->next=p->next; p->next=q; q->next=t->next; q->prior->next=p; p->prior=q->prior; t->next->prior=q; q->prior=p; t->length=p->length; p->length=q->length; q->length=t->length; t=p; p=q; q=t; if(j==a-i)p1=q; } t=t1; q=p; p=p->next; } } } free(t1); head=p1; return; } void OrderLength(LinkList &head) { LinkList p; p=head; for(int i=1;;i++)//重新排列length; { p->length=i; p=p->next; if(p==head) break; } Cprint(head); return; } /*生成10个结点的随机数链表*/ void FormNode(LinkList &head) { if(head==NULL) { srand((unsigned int)time(0)); LinkList p,q; InsetNode(p); p->prior=p; p->next=p; p->data=Rand(); p->length=1; head=p; for(int i=2;i<=10;i++) { q=p; InsetNode(p); p->length=i; p->next=q->next; q->next=p; p->prior=q; head->prior=p; p->data=Rand(); //cout<<p->length<<","<<p->data<<" "; } //Cprint(p); //OrderNode(head,A); }//if(); return; } /*删除链表释放内存*/ void FreeNode(LinkList p) { LinkList q; int a=p->prior->length; for(int i=1;i<=a;i++) { q=p->next; free(p); p=q; } return; } /*插入结点*/ void AddNode(LinkList p,int A) { LinkList q1,q2; q1=p; for(int i=1;i<=NumNode(p);i++) { if(A==q1->length) { InsetNode(q2); q2->next=q1->next; q2->prior=q1; q1->next->prior=q2; q1->next=q2; q2->length=1; cout<<"data="; cin>>q2->data; break; } q1=q1->next; } OrderLength(p); //Cprint(p); return; } int main() { LinkList L,M,N,K; L=M=N=K=NULL; for(;;) { cout<<endl<<" 1. 建立链表(双向循环链表)."<<endl; cout<<" 2. 打印链表."<<endl; cout<<" 3. 反向打印链表."<<endl; cout<<" 4. 删除节点."<<endl; cout<<" 5. 插入链表结点."<<endl; //cout<<" 5. 表尾插入节点."<<endl; cout<<" 6. 重新排列链表."<<endl; cout<<" 7. 合并链表M和N-->K"<<endl; cout<<" 8. 删除链表."<<endl; cout<<" 9. 重新调整链表长度值."<<endl; //cout<<" 9. 反向链表."<<endl; cout<<" 0. 退出."<<endl; //cout<<"11.产生10个随机数"<<endl; cout<<"请选择:"<<endl; int choice; char Line; cin>>choice; switch(choice) { case 1:cout<<"请选择需要建立的链表:"<<endl<<"L为空链表, M、N、K为10个随机数有序表"<<endl; //cout<<endl<<"请输入M,N,K的排序方式0--升序，1--降序\n"; cin>>Line; //if((Line='m'||Line='M')) switch(Line) { case 'l': case 'L': InsetNode(L); L->prior=L; L->next=L; cout<<"请输入Data值:"<<endl; cin>>L->data; break; case 'm': case 'M': cout<<"请输入排列方式0--升序，1--降序"<<endl; cin>>choice; FormNode(M);//cout<<endl<<M<<endl; //Cprint(M); //Cout(M); OrderNode(M,choice);//cout<<endl<<M<<endl; Cprint(M); //Cout(M); break; case 'n': case 'N': cout<<"请输入排列方式0--升序，1--降序"<<en