数据结构例子.docVIP

数据结构例子 数据结构例子（VC++)2008-08-28 10:57TEST.CPP(主文件） // testh.cpp : Defines the entry point for the console application. // #include stdafx.h #includesqlist.h main() { Sqlist *L; int x,i,y,aa=1; while(aa) { printf(\n\n); printf( 1.Creat orderlist.\n); printf( 2.Insert number.\n); printf( 3.Delete number.\n); printf( 4.Print the orderlist.\n); printf(5.print the order.\n); printf(6.print the order.\n); printf( 0.EXIT.\n\n); printf(Please select mark!(1/2/3/4/5/0):); scanf(%d,x); switch(x) { case 1:L=creat_Sqlist();break; case 2: printf(Input the number! x=); scanf(%d,y); printf(Input the place! i=); scanf(%d,i); Sq_insert(L,i,y);break; case 3:printf(Input the place! i=); scanf(%d,y); Sq_delete(L,y);break; case 4:prt_list(L);break; case 0: return 0; default: aa=0;break;} } } Sqlist.h #include stdio.h #include stdlib.h #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define UNDERFLOW -1 #define MAXSIZE 1000 typedef int Elemtp ; typedef struct{ Elemtp elem[MAXSIZE]; int len; }Sqlist ; Sqlist *L; Sq_insert(Sqlist *L ,int i, Elemtp x) {int j; if(i0 || iL-len) return ERROR; if ( L-len==MAXSIZE-1) return OVERFLOW; for (j=L-len;ji-1;--j) L-elem[j]=L-elem[j-1]; L-elem[i-1]=x; ++L-len; return OK; } int Sq_delete (Sqlist *L,int i) { int j; if (i1 || iL-len) return ERROR; if (L-len==0) return UNDERFLOW; for (j=i-1;j=L-len-1;j++) L-elem[j]=L-elem[j+1]; --L-len; return OK; } Sqlist *creat_Sqlist() {int i=0,x; L=(Sqlist *)malloc(sizeof(Sqlist)); if(!L-elem) exit(OVERFLOW); printf(Input the numbers! \n); do {scanf(%d,x); L-elem[i]=x; i++;} while(x!=0); L-len=i-1; return L; } void prt_list(Sqlist *L) { int i; f