實驗一 線性表的順序表示與實現

實驗一  線性表的順序表示與實現

#include <stdio.h> #include <stdlib.h> #include <iostream> #define OVERFLOW -2 #define OK 1 #define ERROR 0 #define LIST_INIT_SIZE 1000 #define Elemtype int// typedef int Elemtype typedef struct { Elemtype *elem; int length; int listsize; }sqlist; int InitList_Sq( sqlist & L,int n ) { // n=0時建立空表 L.elem = (Elemtype*)malloc(LIST_INIT_SIZE*sizeof (Elemtype)); if (!L.elem) exit(OVERFLOW); L.length =n; L.listsize = LIST_INIT_SIZE; return OK; }//最後，對建立的順序表設計插入、刪除、查找等基本操作的算法如下： int ListInsert_Sq(sqlist &L, int i, Elemtype e) { int LISTINCREMENT=i,*q,*p; // 在順序表L的第 i 個元素之前插入新的元素e if (i < 1 || i > L.length+1) return ERROR; if (L.length >= L.listsize) { int *newbase = (Elemtype *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof (Elemtype)); if (!newbase) exit(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; } int ListDelete_Sq (sqlist &L, int i, Elemtype &e) { //刪除算法 Elemtype *p,*q; if ((i < 1) || (i > L.length)) 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; } int locate_sq(sqlist L ,Elemtype x) //查找算法 { int i; for(i=0;i<L.length;i++) if(L.elem[i]==x) return i+1; return 0; } int main() { sqlist l; int n,num,i,x,e; scanf("%d",&n); InitList_Sq(l,n); for (i=1;i<=n;i++) { scanf("%d",&num); ListInsert_Sq(l,i+1,num); } for (i=1;i<=n;i++) printf("%d ",*(l.elem+i)); printf("\n"); scanf("%d",&x); ListDelete_Sq (l, x,e); for (i=1;i<n;i++) printf("%d ",*(l.elem+i)); printf("\n"); scanf("%d",&x); printf("%d\n",locate_sq(l,x)-1); return 0; }