数据结构编程实例.docVIP

. . 数据结构编程实例 顺序表的基本操作 #define LEN 100 typedef struct sqlist{ int a[LEN]; int length; }; void init(struct sqlist *sq) /*初始化*/ {int i; for (i=0;iLEN;i++) sq-a[i]=0; sq-length=0; } void creat(struct sqlist *sq) /*建顺序表*/ {int i; printf(please input length); scanf(%d,sq-length); printf(please input %d nums\n,sq-length); for (i=1; i=sq-length;i++) scanf(%d,sq-a[i]); } void print(struct sqlist *sq) /*输出顺序表*/ { int i; for (i=1; i=sq-length;i++) printf( %d,sq-a[i]); printf(\n); } void insert(struct sqlist *sq,int pos, int x) /*顺序表插入元素*/ {int i; for (i=sq-length;i=pos;i--) sq-a[i+1]=sq-a[i]; sq-a[pos]=x; sq-length=sq-length+1; } int delete(struct sqlist *sq,int pos) /*顺序表删除元素*/ {int i,x; x=sq-a[pos]; for (i=pos+1;i=sq-length;i++) sq-a[i-1]=sq-a[i]; sq-length=sq-length-1; return(x); } main() {int position,x; struct sqlist *list; struct sqlist slist; int xz=0; list =slist; while (1) { printf(1.init\n); printf(2.creat\n); printf(3.insert\n); printf(4.delete\n); printf(5.locate_value\n); printf(6.locate_pos\n); printf(7.print\n); printf(0.exit\n); printf(please input your choice); scanf(%d,xz); switch(xz) {case 1:init(list);break; case 2:creat(list);break; case 3:printf(pleast input inset position(pos) and value(x)); scanf(%d%d,position,x); if (position1||positionlist-length+1||list-length=LEN) printf(position error\n); else insert(list,position,x); break; case 4:printf(pleast input delete position(pos)); scanf(%d,position); if (position1||positionlist-length||list-length==0) printf(position error\n); else printf(delete position=%d,delete data=%d\n,position,delete(list,position)); break;; case 5:; case 6:; case 7:print(list);break; case 0:exit(0); } } } 三种方法建立链表 #include stdio.h typedef struct node {int data; struct node *link;}NODE; NODE *creat1() /*按输入数据的顺序建立链表，输入数据通过个数控制*/ {i