线性链表与顺序表实验.docVIP

数据结构—顺序表实验 代码： #include iostream #include stdio.h using namespace std; #define MAXsize 20 //定义单链表 typedef int ElemType; typedef struct { ElemType a[MAXsize]; int length; }SqList; SqList a; void creat_List(SqList *L); void out_List(SqList L); void Insert_Sq(SqList *L,int i,ElemType e); void Delete_Sq(SqList *L,int i,ElemType e); int main() { int i; ElemType e; char ch; creat_List (a); out_List(a); printf(\n请输入插入位置：,a.length+1); scanf(%d,i); printf(\n请输入要插入的元素的值：); scanf(%d,e); Insert_Sq(a,i,e); out_List(a); printf(\n请输入要删除的元素的位置：); scanf(%d,i); Delete_Sq(a,i,e); out_List(a); ch=getchar(); return 0; } void creat_List(SqList *L) { int i; printf(\n请输入线性表的长度：); scanf(%d,L-length); for(i=0;iL-length;i++) { printf(数据%d=,i); scanf(%d,(L-a[i])); } } void Insert_Sq(SqList *L,int i,ElemType e) { int j; if(L-length==MAXsize) printf(线性表已满!\n); else if(i1||iL-length+1) printf(请输入位置错误!\n); else{ for(j=L-length;j=i;j--) L-a[j]=L-a[j-1]; L-a[i-1]=e; L-length++; } } void Delete_Sq(SqList *L,int i,ElemType e) { int j; if(i1||iL-length) printf(请输入位置错误!\n); e=L-a[i-1]; for(j=i;jL-length;j++) L-a[j-1]=L-a[j]; --L-length; } void out_List(SqList L) { int i; for(i=0;iL.length;i++) printf(%d ,L.a[i]); } 单链表实验 代码： #include iostream #include stdio.h using namespace std; #define MAXsize 20 typedef int ElemType; typedef struct LNode{ ElemType date; struct LNode *next; }LNode,*LinkList; void CreateList(LinkList L,int n) { int i; LinkList p; L=(LinkList)malloc(sizeof(LNode)); L-next = NULL; printf(请输入相应的值：\n); for(i=n; i0; i--) { p=(LinkList)malloc(sizeof(LNode)); scanf(%d,p-date); p-next = L-next; L-next = p; } printf(数据输入结束。\n); } int ListInsert(LinkList L,int i,ElemType e) { int j=0; LinkList p=L; while(pji-1) { p = p-next; ++j; } if(!p||ji-1)return 0; LinkList s = (LinkList)malloc(sizeof(LNode)); s-date = e;s-next = p-next ; p-next = s; return 1; } int ListDelete(LinkList L,int i,ElemType e) { Link