#include #define maximum 20 #define TRUE 1 #define FALSE 0 typedef int DataType; struct List { int n; DataType element[maximum]; }; //下面为函数为在线性表i 处，插入元素a int insert(List list,int i,DataType a) { int x; if (i<0||i>=20) { printf("操作违法\n"); return FALSE; } if(list.n==maximum) { printf("线性表已满，不能插入\n"); return FALSE; } for(x=list.n-1; x>=(i-1); x--) //list.n-1 不能替换为list(n-1) list.element[x+1]=list.element[x]; list.element[i-1]=a; list.n++; //list.n++不能替换为list.(n++),注意这两个不应当加的括号 return TRUE; } //下面函数为删除在线性表i 处的元素 int del(List list,int i) { int x; if (i<0||i>=maximum) { printf("操作违法\n"); return FALSE; } if(list.n==0) { printf("线性表为空，不能进行删除操作\n"); return FALSE; } for(x=(i-1);x #define TRUE 1 #define FALSE 0 #define List_size 100 #define List_increment 10 typedef int Status; typedef int DataType; struct List { DataType *base; int length; int listsize; }; Status Init_List(List &list) { list.base=new Status[List_size]; if(!list.base) return FALSE; list.length=0; list.listsize=List_size; return TRUE; } Status Edit_List(List &list,int n) { list.length=n; for(int i=0;i=*q) { *(c.base+c.length)=*p; p++; c.length++; } else { *(c.base+c.length)=*q; q++; c.length++; } } if(p>a.base+a.length-1) { for(;q<=b.base+b.length-1;q++) { *(c.base+c.length)=*q; c.length++; } } if(q>b.base+b.length-1) { for(;p<=a.base+a.length-1;p++) { *(c.base+c.length)=*p; c.length++; } } for(int i=0;i<=c.length-1;i++) { printf("%d.%d \n",i,*(c.base+i)); } return TRUE; } Status Delete_List(List &list) { delete list.base; return TRUE; } int main() { List list_a,list_b,list_c; Init_List(list_a); Init_List(list_b); Init_List(list_c); Edit_List(list_a,4); Edit_List(list_b,3); Inversion_List(list_a); Union_List(list_a,list_b,list_c); Delete_List(list_a); Delete_List(list_b); Delete_List(list_c); return 0; }
