第三周项目二
来源:互联网 发布:西绪福斯 知乎 编辑:程序博客网 时间:2024/05/20 18:18
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);
- #endif
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;
- }
main函数:
- #include <stdio.h>
- #include <malloc.h>
- #include "list.h"
- int main()
- {
- SqList *sq;
- ElemType a;
- ElemType b;
- ElemType x[6]= {1,2,3,4,5,6};
- CreateList(sq, x, 6);
- DispList(sq);
- printf("表长度:%d\n", ListLength(sq));
- if(GetElem(sq,4,a))
- {
- printf("顺序表第4个元素:%d \n",a);
- }
-
- else
- {
-
- printf("第4个元素超出范围\n");
- }
-
- if(GetElem(sq, 3, a))
- printf("找到了第3个元素值为:%d\n", a);
- else
- printf("第3个元素超出范围!\n");
-
- if(b=LocateElem(sq,3)>0)
- {
- printf("值为3的元素是第 %d 个\n",b);
-
-
- }
- else
- {
- printf("值为8的元素木有找到!\n");
- }
- if((b=LocateElem(sq, 17))>0)
- printf("找到了,值为17的元素是第 %d 个\n", b);
- else
- printf("值为17的元素没有找到!\n");
- printf("初始化插入之后\n");
- InitList(sq);
- ListInsert(sq, 1, 5);
- ListInsert(sq, 2, 3);
- ListInsert(sq, 1, 4);
- DispList(sq);
- return 0;
- }
运行结果: 知识点总结:顺序表的算法以及多文件组织。
学习心得:学会了顺序表的应用。