From c6bc541ab58363d783e60a007e80e9bf9e231fda Mon Sep 17 00:00:00 2001 From: garhve Date: Mon, 5 Dec 2022 19:43:39 +0800 Subject: initialize --- .../sequence.h" | 32 ++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100755 "c/dataStructure/\347\272\277\346\200\247\350\241\250/\351\241\272\345\272\217\350\241\250/sequence.h" (limited to 'c/dataStructure/线性表/顺序表/sequence.h') diff --git "a/c/dataStructure/\347\272\277\346\200\247\350\241\250/\351\241\272\345\272\217\350\241\250/sequence.h" "b/c/dataStructure/\347\272\277\346\200\247\350\241\250/\351\241\272\345\272\217\350\241\250/sequence.h" new file mode 100755 index 0000000..6a48d67 --- /dev/null +++ "b/c/dataStructure/\347\272\277\346\200\247\350\241\250/\351\241\272\345\272\217\350\241\250/sequence.h" @@ -0,0 +1,32 @@ +#ifndef SEQUENCE_H_ +#define SEQUENCE_H_ + +#define MAXSIZE 100 + +#include +#include +#include + +typedef int ElemType; + +typedef struct data { + ElemType * elem; + int length; +} Elem; + +void InitList (Elem * L); +void DestroyList (Elem * L); +void ClearList (Elem * L); +void AddElem (Elem * L, ElemType e); // Add an element, length +1 +bool ListEmpty (Elem * L); +ElemType ListLength (Elem * L); +ElemType GetElem (Elem * L, int i); // Get ith element +ElemType LocateElem (Elem * L, ElemType e); // return element e's position, if not found, return 0 +ElemType PriorElem (Elem * L, ElemType e); // return precedent element of e +ElemType NextElem (Elem * L, ElemType e); // return element after e +bool ListInsert (Elem * L, ElemType e, int i); // insert Elem at i +bool ListDelete (Elem * L, int i); // delete ith element +void TraverseList (Elem * L); // traverse all list +char OperateMenu (void); // show Menu to user + +#endif \ No newline at end of file -- cgit v1.2.3-70-g09d2