- init
- clear
- destory
- check if the list is empty
- get the length of the list
- get the element in index
- get the first element's index which meet the comparison condition
- prior element
- next element
- insert
- delete
- iterate the list in certain rule
- union
- MergeSqList_1(use insert function)
- MergeSqList_2(use pointer address)
- init
- clear
- destory
- check if the list is empty
- get the length of the list
- get the element in index
- get the first element's index which meet the comparison condition
- prior element
- next element
- insert
- delete
- iterate the list in certain rule
- head interpolation to create list
- tail inserting to create list
- mergeList
- provide total storage
- get the storage the list needs
- free one element
- init the list
- empty the list
- destory
- check empty
- get the length of the list
- get the element in index
- get the first element's index which meet the comparison condition
- prior
- next< 8E7F /li>
- insert
- delete
- iterate the list
###(stack);
- InitList_Sq(SqStack *S);
- DestoryStock_Sq(SqStack *S);
- ClearStack_Sq(SqStack *S);
- StackEmpty_Sq(SqStack S);
- StackLength_Sq(SqStack S);
- GetTop_Sq(SqStack s,SElemType_Sq *e);
- Push_sq (SqStack *s,SElemType_Sq e);
- Pop_Sq(SqStack *s,SElemType_Sq *e);
- StackTraverse_Sq(SqStack s,void(Visit)(SElemType_Sq));
#####Decimal to octal
- conversionNum(e); #####LineEdit
- LineEdit(e);
#####Maze
- typedef int MazeType;
- void InitMaze(MazeType maze[][N],Postype *start,Postype *end);
- void PaintMaze(MazeType maze[][N]);
- void ShowMaze(MazeType maze[][N]);
- Status EqualPosType(Postype a,Postype b);
- Status Pass(Postype seat,MazeType maze[][N]);
- void FootPrint(Postype seat,MazeType maze[][N]);
- void SetSElemType(SElemType_Sq *e, int ord,Postype seat, int di);
- Postype NextPos(Postype seat, int di);
- Status IsCross(Postype seat);
- void MarkPrint(Postype seat,MazeType maze[][N]);
###链表：(Linear List); ####顺序列表
- 初始化
- 清空
- 销毁
- 判断是否是空列
- 列长
- 获取某个位置的数
- 根据条件取值（第一个满足的值）
- 前驱
- 后继
- 插入
- 删除
- 遍历
- 合并
- MergeSqList_1(使用插入方法)
- MergeSqList_2(使用指针)
- 初始化
- 清空
- 销毁
- 判断是否是空列
- 列长
- 获取某个位置的数
- 根据条件取值（第一个满足的值）
- 前驱
- 后继
- 插入
- 删除
- 遍历
- 头插法建立单链表
- 尾插法建立单链表
- 归并
- 申请总的空间
- 申请某个链表的空间
- 释放某个节点
- 初始化静态链表
- 置空
- 销毁
- 判空
- 求长
- 查询
- 定位
- 前驱
- 后继
- 插入
- 删除
- 遍历
###栈：(stack);
- InitList_Sq(SqStack *S);
- DestoryStock_Sq(SqStack *S);
- ClearStack_Sq(SqStack *S);
- StackEmpty_Sq(SqStack S);
- StackLength_Sq(SqStack S);
- GetTop_Sq(SqStack s,SElemType_Sq *e);
- Push_sq (SqStack *s,SElemType_Sq e);
- Pop_Sq(SqStack *s,SElemType_Sq *e);
- StackTraverse_Sq(SqStack s,void(Visit)(SElemType_Sq));
#####十进制转换为八进制
- conversionNum(e); #####行编辑程序
- LineEdit(e); #####迷宫
- typedef int MazeType;
- void InitMaze(MazeType maze[][N],Postype *start,Postype *end);
- void PaintMaze(MazeType maze[][N]);
- void ShowMaze(MazeType maze[][N]);
- Status EqualPosType(Postype a,Postype b);
- Status Pass(Postype seat,MazeType maze[][N]);
- void FootPrint(Postype seat,MazeType maze[][N]);
- void SetSElemType(SElemType_Sq *e, int ord,Postype seat, int di);
- Postype NextPos(Postype seat, int di);
- Status IsCross(Postype seat);
- void MarkPrint(Postype seat,MazeType maze[][N]);