线性表的顺序存储

分手后的思念是犯贱 2022-09-13 11:28 183阅读 0赞

#include <stdio.h>
    #include <stdlib.h>
    #define maxn 20
    typedef int elemtype;
    typedef struct{ 
        elemtype a[maxn];
        int length;
    } sqlist;
    sqlist a,b,c;
    
    void creat_list(sqlist *L);
    void out_list(sqlist L);
    void insert_sq(sqlist *L, int i, elemtype e);
    elemtype delete_sq(sqlist *L, int i);
    int locat_sq(sqlist L, elemtype e);
    void overlap_list(sqlist *L1,sqlist *L2);
    
    int main(){ 
        int i, k, loc;
        elemtype e, x;
        char ch;
        do{ 
            printf("\n\n\n");
            printf("\n 1.建立线性表");
            printf("\n 2.在i位置插入元素 e");
            printf("\n 3.删除第i个元素，返回其值");
            printf("\n 4.查找值为 e 的元素");
            printf("\n 5.求表长");
            printf("\n 6.表的输出");
            printf("\n 7.求集合A和B的对称差集，结果存放在A中，要求不引进新的集合");
            printf("\n 8.结束程序运行");
            printf("\n============================================");
            printf("\n 请输入您的选择(1,2,3,4,5,6,7,8)");
            scanf("%d", &k);
            switch(k){ 
                case 1:{ 
                    creat_list(&a);
                    out_list(a);
                }
                break;
                case 2:{ 
                    printf("\n i,e=?");
                    scanf("%d %d", &i, &e);
                    insert_sq(&a, i, e);
                    out_list(a);
                }
                break;
                case 3:{ 
                    printf("\n i=?");
                    scanf("%d %d", &i, &e);
                    x = delete_sq(&a, i);
                    out_list(a);
                    printf("\n x=%d", x);
                }
                break;
                case 4:{ 
                    printf("\n e=?");
                    scanf("%d", &e);
                    loc = locat_sq(a, e);
                    if(loc==-1)
                        printf("\n 未找到 %d", loc);
                        else
                            printf("\n 已找到，元素位置是 %d", loc);
                }
                break;
                case 5:{ 
                    sqlist *l;
                    printf("表的长度为 %d", l->length);
                }
                break;
                case 6:{ 
                    out_list(a);
                }
                break;
                case 7:{ 
                    char a, b;
                    //求 A ∪ B = A 
                    overlap_list(a, b);
                }
                break;
            }
        }while(k!=8);
        printf("\n 再见!");
        printf("\n 按 Enter 键，返回。");
        ch = getchar();
        return 0;
    }
    
    void creat_list(sqlist *L){ 
        int i;
        printf("\n n=?");
        scanf("%d", &L->length);
        for (i = 0; i < L->length; i++){ 
            printf("\n data %d=?",i);
            scanf("%d", &(L->a[i]));
        }
    }
    
    void out_list(sqlist L){ 
        int i;
        char ch;
        printf("\n");
        for (i = 0;i<L.length-1;i++)
            printf("%10d", L.a[i]);
        printf("\n\n 按 Enter 键，继续。");
        ch = getchar();
    }
    
    void insert_sq(sqlist *L,int i,elemtype e){ 
        int j;
        if(L->length==maxn)
            printf("\n overflow !");
            else if(i<1||i>L->length-1) printf("\n error !");
            else{ 
                for (j = L->length - 1; j > i - 1;j--)
                    L->a[j + 1] = L->a[j];
                    L->a[i-1]=e;
                    L->length++;
            }
    }
    
    elemtype delete_sq(sqlist *L,int i){ 
        elemtype x;
        int j;
        if(L->length==0)
            printf("\n 是空表。underflow!");
        else if(i<1||i>L->length-1){ 
            printf("\n error !");
        x = -1;
        }
        else{ 
            x = L->a[i-1];
            for (j = i; j < L->length - 1;j++)
                L->a[j - 1] = L->a[j];
            L->length--;
        }
        return (x);
    }
    
    int locat_sq(sqlist L,elemtype e){ 
        int i = 0;
        while(i<=L.length-1&&L.a[i]!=e)
        i++;
        if(i<=L.length-1)
            return (i + 1);
            else
                return (-1);
    }
    
    void overlap_list(sqlist *L1,sqlist *L2){ 
        int len;
        len = L1->length + L2->length;
        int i, j, k = 0;
        for(i = L1->length - 1;i < len;i++){ 
            for (j = 0; j < L2->length;j++){ 
                L1->a[i]=L2->a[j];
            }
        }
        for(i = 0; i < L1->length; i++){ 
    		for(j = L1->length - 1; j < len; j++) { 
    			if(L1->a[i]==L1->a[j]) { 
    				L1->a[i] = -1;
    				continue;
    			}
    		}
    	}
        locat_sq(*L1, -1);
        delete_sq(L1, i + 1);
        for(i = 0; i < len; i++){ 
    		printf("%d ",L1->a[i]);
    	}
    }