第三周项目2
来源:互联网 发布:四大名著 知乎 编辑:程序博客网 时间:2024/06/05 20:08
-
-
-
-
-
-
-
-
-
-
-
-
-
- #include "123.h"
- int main()
- {
- SqList *sq;
- ElemType x[6]= {1,2,3,2,8,7};
- CreateList(sq, x, 6);
- DispList(sq);
- return 0;
- }
- <pre code_snippet_id="2577424" snippet_file_name="blog_20170914_2_9979714" name="code" class="cpp">
- #include <stdio.h>
- #include <malloc.h>
- #include "123.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;
- }
- </pre><pre code_snippet_id="2577424" snippet_file_name="blog_20170914_4_2455733" name="code" class="cpp"></pre><pre code_snippet_id="2577424" snippet_file_name="blog_20170914_4_2455733" name="code" class="cpp"></pre>
- <pre></pre>
- <p><br>
- </p>
- <p></p><pre code_snippet_id="2577424" snippet_file_name="blog_20170914_5_8137334" name="code" class="cpp">
- #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);
- </pre><br>
- <img src="http://img.blog.csdn.net/20170914110057494" alt=""><br>
- <p></p>