第3周项目3 求集合并集
来源:互联网 发布:Ubuntu 软件怎么打不开 编辑:程序博客网 时间:2024/05/01 17:46
问题及代码:
main.cpp:- #include "list.h"
- #include <stdio.h>
-
-
- int main()
- {
- SqList *sq_a, *sq_b, *sq_c;
- ElemType a[6]= {5,8,7,2,4,9};
- CreateList(sq_a, a, 6);
- printf("LA: ");
- DispList(sq_a);
-
- ElemType b[6]= {2,3,8,6,0};
- CreateList(sq_b, b, 5);
- printf("LB: ");
- DispList(sq_b);
- unionList(sq_a, sq_b, sq_c);
- printf("LC: ");
- DispList(sq_c);
- return 0;
- }
list.h;- #ifndef LIST_H_INCLUDED
- #define LIST_H_INCLUDED
-
-
- #define MaxSize 50
- typedef int ElemType;
- typedef struct
- {
- ElemType data[MaxSize];
- int length;
- } SqList;
- void CreateList(SqList *&L, ElemType a[], int n);
- void InitList(SqList *&L);
- void DestroyList(SqList *&L);
- bool ListEmpty(SqList *L);
- int ListLength(SqList *L);
- void DispList(SqList *L);
- bool GetElem(SqList *L,int i,ElemType &e);
- int LocateElem(SqList *L, ElemType e);
- bool ListInsert(SqList *&L,int i,ElemType e);
- bool ListDelete(SqList *&L,int i,ElemType &e);
- void unionList(SqList *LA, SqList *LB, SqList *&LC);
- #endif // LIST_H_INCLUDED
list.cpp:- #include <stdio.h>
- #include <malloc.h>
- #include "list.h"
-
-
- void CreateList(SqList *&L, ElemType a[], int n)
- {
- int i;
- L=(SqList *)malloc(sizeof(SqList));
- for (i=0; i<n; i++)
- L->data[i]=a[i];
- L->length=n;
- }
-
-
- void InitList(SqList *&L)
- {
- L=(SqList *)malloc(sizeof(SqList));
-
- L->length=0;
- }
-
-
- void DestroyList(SqList *&L)
- {
- free(L);
- }
-
-
- bool ListEmpty(SqList *L)
- {
- return(L->length==0);
- }
-
-
- int ListLength(SqList *L)
- {
- return(L->length);
- }
-
-
- void DispList(SqList *L)
- {
- int i;
- if (ListEmpty(L)) return;
- for (i=0; i<L->length; i++)
- printf("%d ",L->data[i]);
- printf("\n");
- }
-
-
- bool GetElem(SqList *L,int i,ElemType &e)
- {
- if (i<1 || i>L->length) return false;
- e=L->data[i-1];
- return true;
- }
-
-
- int LocateElem(SqList *L, ElemType e)
- {
- int i=0;
- while (i<L->length && L->data[i]!=e) i++;
- if (i>=L->length) return 0;
- else return i+1;
- }
-
-
- bool ListInsert(SqList *&L,int i,ElemType e)
- {
- int j;
- if (i<1 || i>L->length+1)
- return false;
- i--;
- for (j=L->length; j>i; j--)
- L->data[j]=L->data[j-1];
- L->data[i]=e;
- L->length++;
- return true;
- }
-
-
- bool ListDelete(SqList *&L,int i,ElemType &e)
- {
- int j;
- if (i<1 || i>L->length)
- return false;
- i--;
- e=L->data[i];
- for (j=i; j<L->length-1; j++)
- L->data[j]=L->data[j+1];
- L->length--;
- return true;
- }
-
- void unionList(SqList *LA, SqList *LB, SqList *&LC)
- {
- int lena,i;
- ElemType e;
- InitList(LC);
- for (i=1; i<=ListLength(LA); i++)
- {
- GetElem(LA,i,e);
- ListInsert(LC,i,e);
- }
- lena=ListLength(LA);
- for (i=1; i<=ListLength(LB); i++)
- {
- GetElem(LB,i,e);
- if (!LocateElem(LA,e))
- ListInsert(LC,++lena,e);
- }
- }
- 运行结果:
- 知识总结:算法库很重要
- 学习心得:多积累一些算法
0 0