《数据结构课本算法实现》.doc

线性结构 一 类型定义 1 顺序表# define MAXSIZE 100typedef struct node typedef struct{ ElemType data; { ElemType data [MAXSIZE];struct node * next;int length;}SLink; }SqList; 2 单链表 3双链表 typedef struct node { ElemType data;struct node *prior,*next; }dlink; 二 基础要点 1单链表2双链表 三 算法 1 删除顺序表中重复元素 void delsame( int A[], int count ) { int i, j, k;if( N 1 ){ j = 1;for( i =1; i N; i++ ){ k = 0;while( k j A[k] != A[i] ) k++;if( k = j )A[j++] == A[i];}A[j] == ‘\0’} } 2 给无序表建有序索引表 typedef struct indexelem { KeyType key; //关键字 intsn; //序号 }IndexType;//索引项 IndexType idx[1...m]; //索引表 DataType data[1...m]; //原顺序表 for( i = 1; i =m; i++ ) { j = i - 1; while( j 0 idx[j].key data[i].key ) //把大于data[i].key的所有idx[j].key后移 { idx[j+1] = idx[j]; j--; } idx[j+1].key = data[i].key;//插入data[i].key至idx中，并记下其序号i idx[j+1].sn = i; } 3 逆置单链表 void reverse( LinkList H ){ SNode *p, *temp;P = H-next;H-next = NULL;while( p ){ temp = p;p = p-next;temp-next = H-next;H-next = temp;} } void reverse( LinkList H ){ SNode *p, *q, *temp;P = H-next;q = NULL;while( p ){ temp = p;p = p-next;temp-next = q;q = temp;}H-next = q; } 4拆分单链表 decompese( SNode *L,SNode *ha,SNode *hb,SNode *hc ) {SNode *temp,*p; p = L; ha = (SNode*)malloc(sizeof(SNode)); hb = (SNode*)malloc(sizeof(SNode)); hc = (SNode*)malloc(sizeof(SNode)); ha-next = ha; hb-next = hb; hc-next = hc; while( p ) { if( (p-data = ‘A’ p-data = ‘Z’)||(p-data = ‘a’ p-data = ‘z’) ){ temp = p;p = p-next;temp-next = ha-next;ha-next = temp;} else if(p-data = ‘0’ p-data = ‘9’ ) {temp = p;p = p-next;temp-next = hb-next;hb-next = temp; } else {temp = p;p = p-next;temp-next = hc-next;hc-next = temp; } } } 5 删除单链表重复元素 void delete(LinkList H) { SNode *p,*q,*r;P = H-next;while( p != NULL ){ q=p; while ( q-next ){ if ( q-next-data == p-data ){ r = q-next;q-next = r-next;free(r);}else q = q-next; } p = p-next; } } 6 合并单链表 LinkList merge(LinkList A,LinkList B){ LinkList C; SNode *p,*q;P = A-next; q = B-ne