/* 说明 : 由于在实现算法的过程中, 我们无法验证自己的思想的正确性, 所以用 c++ 实现了并进行了验证 数据结构以突出思想, 体现结构的逻辑结构为主, 所以在看算法的时候, 主要看思想和逻辑,

Transcription

1 /* 说明 : 由于在实现算法的过程中, 我们无法验证自己的思想的正确性, 所以用 c++ 实现了并进行了验证 数据结构以突出思想, 体现结构的逻辑结构为主, 所以在看算法的时候, 主要看思想和逻辑, 对于变量和结构的定义, 都可以忽略, 以及最后的 main() 函数, 在查看的时候发现各种疑问欢迎与我们助教讨论 */ //Header.h 常量及结构的申明. #definetrue 1 #definefalse 0 #defineok 1 #defineerror 0 #defineinfeaslble 1 #defineoverflow 2 typedefintstatus; typedefintelemtype; #definelist_init_size 100 #definelistincrement 10 typedefstruct ElemType *elem; int length; int listsize; Sqlist; typedefstructlnode ElemType data; LNode *next; LNode, *LinkList; typedefstructdulnode ElemType data; DulNode *prior; DulNode *next; DulNode, *DulLinkList; Source.cpp #include"header.h"

2 #include<stdio.h> #include<stdlib.h> #include<iostream> usingnamespace std; Status InitList_Sq(Sqlist&L) L.elem=(ElemType *) malloc(list_init_size*sizeof(elemtype)); if(!l.elem) exit(overflow); L.length=0; L.listsize=LIST_INIT_SIZE; // InitList_Sq //2.3 Status ListInsert_Sq(Sqlist&L,ElemTypee) // Insert element e in the sequence in a ascending order. if(l.length>=l.listsize) ElemType * newbase; newbase=(elemtype *) realloc (L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType)); L.elem=newbase; L.listsize+=LISTINCREMENT; int i; for (i=0;i<l.length;) if(l.elem[i]<=e) i++; ElemType *p; ElemType *q; if(i==0) q=&(l.elem[0]); q=&(l.elem[i 1]);

3 for(p=&(l.elem[l.length 1]);p>=q; p) *(p+1)=*p; *q=e; ++L.length; break; if(i==l.length) L.elem[L.length]=e; L.length++; //2.4(1) Status ListInsert_WithHeadNode(LinkList&L, ElemTypee) // insert the element in the LinkList with a ascending order. LinkList P,Q; P=L >next; while(p) if(p >data<=e) Q=P; P=P >next; LinkList S=(LinkList)malloc(sizeof(LNode)); S >data=e; Q >next=s; S >next=p; LinkList S=(LinkList)malloc(sizeof(LNode)); S >data=e; P=S; S >next=null;

4 //2.4(2) Status ListInsert_WithoutHeadNode(LinkList&L, ElemTypee) // Insert the element in the ascending order in the link list without headnode. LinkList P,Q; P=L;// perhaps this is the difference between head and without head... while(p) if(p >data<=e) Q=P; P=P >next; LinkList S=(LinkList)malloc(sizeof(LNode)); S >data=e; Q >next=s; S >next=p; LinkList S=(LinkList)malloc(sizeof(LNode)); S >data=e; P=S; S >next=null; delete(p); delete(q); //2.5 Status ListInvert_Sq(Sqlistlist) // invert the list in the original memory. 2.5 int i=0; if(list.length) while ((i!=list.length 1 i)&&(list.length 1 i i!=1)) // stop inverting. ElemType temp; temp=list.elem[i]; list.elem[i]=list.elem[list.length i 1]; list.elem[list.length i 1]=temp; i++;

5 cout<<"empty list!"<<endl; returnfalse; //2.6 Status LinkListwithHeadNodeInvert(LinkList&L) //chapter 2.6 //invert the linklist, 从第二个节点开始打断放到第一个, 依次类推, 便可逆置 LinkList p,q; p=l >next; if(!p!p >next) cout<<"empty link list or only contain one element"<<endl; q=p >next; p >next=null; while(q) p=q >next; q >next=l >next; L >next=q; q=p; //2.7 Sqlist DeleteDuplicate_Sq(Sqlist&L) //2.7.1 delete the duplicate elements in disorder sequences... //the second question delete the duplicate elements in ascending sequences can be same... if(l.length==0 L.length==1)

6 cout<<"no duplicate element cause less then 2 elements"<<endl; returnl; Sqlist newl; InitList_Sq(newl); newl.elem[0]=l.elem[0]; newl.length=1; for(int i=1;i<l.length;i++) int j=0; int flag=1; while(j<i) if(l.elem[j]==l.elem[i]) flag=0; break; j++; if(flag) newl.elem[newl.length]=l.elem[i]; newl.length++; //2.8 delete(l.elem); return newl; Status DeleteDuplicate_LinkList(LinkList&L) // with headnode LinkList p=l >next; LinkList q=l >next; if(!p!p >next) cout<<"no duplicate elements for less than 2 elements"<<endl;

7 LinkList temp; while (p) temp=l >next; while(temp!=p) if(temp >data==p >data) q >next=p >next;//delete the duplicate element. break; temp=temp >next; //2.9 Status MergeLinkList(LinkList&A, LinkList&B) //assume A and B both have headnode... LinkList p=b >next; while(p) ListInsert_WithHeadNode(A,p >data); // then inverse A to get the descending order. LinkListwithHeadNodeInvert(A); //2.10 Status DeletePrevious_LinkList(LinkLists) //2.10 this is the special link list without head and end. it is a circle. // what we will do is to delete the previous element. LinkList p,q;

8 p=s; if(p >next=s) cout<<"one element only, so just delete the whole linklist"<<endl; delete(s); while(p >next!=s) q=p; q >next=s;//delete the previous element. //2.11 Status SplitLinkList(LinkList&L, LinkList&alphalist, LinkList&numberlist, LinkList&otherlist) // just split into three parts... chaper 2.11 // quite easy... LinkList p,q; p=l; q=l; //with headnode while(p) q >next=p >next; if(p >data>='0'&&p >data<='9') p >next=numberlist >next; numberlist >next=p; if((p >data>='a'&&p >data<='z') (p >data>='a')&&(p >data<='z')) p >next=alphalist >next; alphalist >next=p; p >next=otherlist >next; otherlist >next=p;

9 delete(l); //2.12 Status SplitSqlistbyOddandEven(Sqlist&L) //chapter 2.12 two point from head and end to compare. int i,j,k; k=0; i=0; j=l.length 1; while (i<=j) while(l.elem[i]%2!=0&&i<=j) i++; while (L.elem[j]%2==0&&i<=j) j ; if(i<j) ElemType temp; temp=l.elem[i]; L.elem[i]=L.elem[j]; L.elem[j]=temp; i++; j ; //2.13 Status ChangeDoubleLinkList(DulLinkListL,intn) //put even node to the end start from the end, then it will be like chapter 2.6 DulLinkList p,q;

10 if(!l!l >next!l >next >next) cout<<"no more than 2 elements, no need to change the dullinklist"<<endl; // here we make an assumption that the n is known, if unkown, we can go through the doublelinklist to get n q=l >prior; p=l >prior; int index=0; if (n%2==0)//n is even number p=p >prior; q=p; p=p >prior; while (q!=l) p >next >prior=p >prior; p >prior >next=p >next;// delete even note; p >prior=l >prior; L >prior >next=p; p >next=l; L >prior=p; q=q >prior; p=q >prior;// move to // n is odd number p=p >prior; while (q!=l) p >next >prior=p >prior; p >prior >next=p >next;// delete even note; p >prior=l >prior; L >prior >next=p; p >next=l; L >prior=p; q=q >prior; p=q >prior;// move to

11 int main() // the entrance, we can test our functions here. LinkList list,p,p1; list=(linklist)malloc(sizeof(lnode)); list >next=null;//initialization... p=list; for( int i =0;i<10;i++) LinkList s=(linklist) malloc(sizeof(lnode)); s >data=i; s >next=null; p >next=s; /*LinkList list1=(linklist)malloc(sizeof(lnode)); list1 >next=null; p1=list1; for(int i=0;i<3;i++) LinkList s=(linklist) malloc(sizeof(lnode)); s >data=i; s >next=null; p1 >next=s; p1=p1 >next; MergeLinkList(list,list1);*/ p=list >next; while(p) cout<<p >data<<endl; LinkListwithHeadNodeInvert(list);

12 //ListInsert_WithoutHeadNode(list,3); p=list >next; while(p) cout<<p >data<<endl; Sqlist L; InitList_Sq(L); for (int i =0;i<9;i++) L.elem[i]=i; L.length=9; int e=0; ListInsert_Sq(L,e); SplitSqlistbyOddandEven(L); //ListInvert_Sq(L); //Sqlist N =DeleteDuplicate_Sq(L); for(int i=0;i<l.length;i++) cout<<l.elem[i]<<endl; return 0;