攻城狮Jana的学习博客

Queue.h#pragma once#include <stdio.h>#include <assert.h>#include <stdlib.h>typedef int QDataType;typedef struct QListNode //链式结构：表示队列{ QDataType data; struct QueueNode *next;}QueueNode;typedef struct Queue //队列结构{ QueueNod

Stack.h#pragma onece#include <stdio.h>#include <assert.h>typedef int STDataType;typedef struct Stack{ STDataType *a; int top; int capacity;}Stack;void StackInit(Stack *pst); //初始化void StackDestory(Stack *pst); //销毁void StackPush

List.h#pragma once#include <stdio.h>#include <stdlib.h>#include <assert.h>typedef int ListDataType;typedef struct ListNode{ struct ListNode *next; struct ListNode *prev; ListDataType data;}ListNode;ListNode* ListInit(); //创

SList.h#pragma once#include <stdio.h>#include <stdlib.h> typedef int SLTDataType;typedef struct SListNode{ SLTDataType data; struct SListNode* next;}SListNode;SListNode* BuySListNode(SLTDataType x); //动态申请结点void SListPrint(SListN

SeqList.h#pragma once#include <stdio.h>#include <stdlib.h>#include <assert.h>#include <string.h> typedef int SLDatatype;typedef struct SeqList{ SLDatatype *a; //指向动态开辟的数组 int size; //有效数据个数 int capacity; //容量空间大小}Seq