#include<stdio.h>#include<stdlib.h>#define TRUE  1#define FALSE 0#define OK   1#define ERROR 0#define OVERFLOW -2#define LIST_INIT_SIZE 100#define LISTINCREMENT 10typedef int status ;typedef int ElemType ;typedef struct{ ElemType *elem; int length,listsize;}SqList;status InitList(SqList &L)//初始化{ L.elem=(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType)); if(!L.elem) exit(OVERFLOW); L.listsize=LIST_INIT_SIZE; L.length=0; return OK;}status Build(SqList &L)//建立表{ int i,n; printf("請(qǐng)輸入元素個(gè)數(shù)n和n個(gè)元素/n"); scanf("%d",&n); if(n>LIST_INIT_SIZE)//如果n大于當(dāng)前空間 { L.elem=(ElemType *)realloc(L.elem,(n+LISTINCREMENT)*sizeof(ElemType)); if(!L.elem) exit(OVERFLOW); L.listsize=n+LISTINCREMENT; } for(i=0;i<n;i++) scanf("%d",L.elem+i); L.length=n; return OK;}void Print(SqList &L)//輸出表中元素和長(zhǎng)度{ int i; for(i=0;i<L.length;i++) printf("%d ",*(L.elem+i)); printf("/n長(zhǎng)度為:%d/n/n",L.length);}void Tips()//提示函數(shù){ printf("請(qǐng)選擇你的想要的操作：/n"); printf("<1> 輸出順序表及順序表的長(zhǎng)度/n"); printf("<2> 刪除值為x的結(jié)點(diǎn)/n"); printf("<3> 刪除給定位置i的結(jié)點(diǎn)/n"); printf("<4> 將順序表逆置/n"); printf("<5> 將順序表按升序排序/n"); printf("<6> 將x插入到順序表的適當(dāng)位置上/n"); printf("<7> 將兩個(gè)有序表合并/n"); printf("<0> 退出/n/n");}status ListDelete1(SqList &L,int x)//刪除值為X的元素{ int i; for(i=0;i<L.length;i++) if(*(L.elem+i)==x)  break; if(i==L.length) return ERROR; for(i++;i<L.length;i++) *(L.elem+i-1)=*(L.elem+i); L.length--; return OK;}status ListDelete2(SqList &L,int x)//刪除第X個(gè)元素{ int i; if(x<0||x>=L.length) return ERROR; for(i=x+1;i<L.length;i++) *(L.elem+i-1)=*(L.elem+i); L.length--; return OK;}void Inverse(SqList &L)//逆置函數(shù){ int i,t; for(i=0;i<L.length/2;i++) { t=*(L.elem+i); *(L.elem+i)=*(L.elem+L.length-i-1); *(L.elem+L.length-i-1)=t; }}void Sort(SqList &L)//冒泡排序（升序）{ int i,j,t; for(i=1;i<L.length;i++) for(j=0;j<L.length-i;j++) {  if(*(L.elem+j)>*(L.elem+j+1))  {   t=*(L.elem+j);   *(L.elem+j)=*(L.elem+j+1);   *(L.elem+j+1)=t;  } } printf("已按升序排列/n/n");}status ListInsert(SqList &L,int x)//將X插入，使仍然有序{ int i,k; if(L.length>=L.listsize) { L.elem=(ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType)); if(!L.elem) exit(OVERFLOW); L.listsize+=LISTINCREMENT; } for(i=0;i<L.length;i++) if(x<*(L.elem+i))  break; k=i; for(i=L.length;i>k;i--) *(L.elem+i)=*(L.elem+i-1); *(L.elem+k)=x; L.length++; return OK;}status Merger(SqList &L,SqList &Lb)//合并兩個(gè)線性表{ int i,j,k; SqList Lc; InitList(Lc); if(Lc.listsize<L.length+Lb.length) { Lc.elem=(ElemType *)realloc(Lc.elem,(L.length+Lb.length+LISTINCREMENT)*sizeof(ElemType)); if(!L.elem) exit(OVERFLOW); Lc.listsize=L.length+Lb.length+LISTINCREMENT; } i=j=k=0; while(i<L.length && j<Lb.length) { if(*(L.elem+i) < *(Lb.elem+j)) {  *(Lc.elem+k)=*(L.elem+i);  k++;i++; } else {  *(Lc.elem+k)=*(Lb.elem+j);  k++;j++; } } while(i<L.length) { *(Lc.elem+k)=*(L.elem+i); k++;i++; } while(j<Lb.length) { *(Lc.elem+k)=*(Lb.elem+j); k++;j++; } Lc.length=L.length+Lb.length; L=Lc; return OK;}int main(){ int op,x,flag; SqList L,Lb; InitList(L); Build(L); Tips(); scanf("%d",&op); while(op) { switch(op) { case 1:  Print(L);  break; case 2:  printf("請(qǐng)輸入要?jiǎng)h除的數(shù)據(jù)X:/n");  scanf("%d",&x);  flag=ListDelete1(L,x);  if(flag)  printf("刪除成功!!/n/n");  else  printf("元素不存在,刪除失敗!!/n/n");  break; case 3:  printf("請(qǐng)輸入要?jiǎng)h除的位置i:/n");  scanf("%d",&x);  flag=ListDelete2(L,x-1);//第i個(gè)元素對(duì)應(yīng)的下標(biāo)為i-1  if(flag)  printf("刪除成功!!/n/n");  else  printf("元素不存在,刪除失敗!!/n/n");  break; case 4:  Inverse(L);  break; case 5:  Sort(L);  break; case 6:  printf("請(qǐng)輸入要插入的數(shù)據(jù)X:/n");  scanf("%d",&x);  flag=ListInsert(L,x);     if(flag)  printf("插入成功!!/n/n");  else  printf("插入失敗!!/n/n");  break; case 7:  printf("請(qǐng)輸入Lb的內(nèi)容:/n");  InitList(Lb);  Build(Lb);  flag=Merger(L,Lb);  if(flag)  printf("合并成功!!/n/n");  break; }  Tips();  scanf("%d",&op); } return 0;}