xianxingbiao.zip_L.E.L

#include<stdio.h> #include<stdlib.h> #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVERFLOW -2 #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 typedef int Status; typedef int Elemtype; typedef struct { Elemtype *elem; int length; int listsize; } SqList; Status Initlist_Sq(SqList &L)//构造一个空的线性表L { L.elem = (Elemtype *)malloc(LIST_INIT_SIZE * sizeof (Elemtype)); if (!L.elem) return(OVERFLOW); L.length = 0; L.listsize = LIST_INIT_SIZE; return OK; } Status ListInsert_Sq(SqList&L, int i, Elemtype e) { Elemtype *newbase,* p, *q; if (i < 1 || i > L.length + 1)return ERROR; if (L.length > L.listsize) { newbase = (Elemtype*) realloc(L.elem, (L.listsize + LISTINCREMENT) * sizeof (Elemtype)); if (!newbase)return(OVERFLOW); L.elem = newbase; L.listsize += LISTINCREMENT; } q =& L.elem[i - 1]; for (p =&( L.elem[L.length - 1]); p >= q; --p) *(p + 1) = *p; *q = e; ++L.length; return OK; } Status ListDelete_Sq(SqList&L, int i, Elemtype &e) { int *p, *q; if (i < 1 || i > L.length + 1)return ERROR; p = &(L.elem[i - 1]); e = *p; q = L.elem + L.length - 1; for (++p; p <= q; ++p) *(p - 1) = *p; --L.length; return OK; } Status ListCreat_Sq(SqList &L) { int i,x,n; printf("how many number do you want to scanf?"); scanf("%d",&n); printf("creat your list now: "); for (i=1; i<=n; i++) { scanf("%d",&x); ListInsert_Sq(L,i,x); } return OK; } Status ListLength_sq(SqList &L) { return( L.length); } Status ListPrint_Sq(SqList &L) { int i; for (i=0; i <L.length; i++) printf("%d ", L.elem[i]); printf("\n"); return OK; } int main() { SqList L; int i,j,len,e,f; if (!Initlist_Sq(L))printf("init fail.\n") ; else printf("init success!\n\n"); printf("**************************************\n"); ListCreat_Sq(L); len=ListLength_sq(L); printf("your list has %d elem.\n",len); printf("they are:\n"); ListPrint_Sq(L) ; printf("**************************************\n"); printf("where do you want to insert?\nputs it:"); scanf("%d",&i); printf("what item do you want to insert?\nputs it:"); scanf("%d",&e); ListInsert_Sq(L,i,e); printf("now your list is:\n"); ListPrint_Sq(L) ; printf("**************************************\n"); printf("where do you want to delet?\nputs it:"); scanf("%d",&j); printf("the elem you want to delet is:"); scanf("%d",&f); ListDelete_Sq(L,j,f); printf("now your list is:\n"); ListPrint_Sq(L) ; return 0; }