Quarrie的博客

ShareStack.h#pragma once/*顺序表的两端分别作为双栈的栈底，当整个线性表没有空间时，双栈满*/#define MAX_SIZE 20#define ERROR -1#define OVERFLOW -2#define LEFT 0#define RIGHT 1typedef char ElemType;typedef struct { Elem...

DeQueue.h#pragma once/*双端队列（注：不是双向队列）：是一种具有队列和栈的性质的数据结构。双端队列中的元素可以从两端弹出，其限定插入和删除操作在表的两端进行。*/#define MAX_SIZE 20#define ElemType int#define OVERFLOW -2#define ERROR -1typedef struct { E...

SequenceQueue.h#pragma once#define ElemType char#define QuenueSize 5#define ERROR -1#define OVERFLOW -2typedef struct SequenceQueue { ElemType* base; int front; int rear; int size;} Qu...

LinkQueue.h#pragma once#define ElemType char#define ERROR -1#define OVERFLOW -2typedef struct QueueNode{ ElemType data; struct QueueNode* next;} Node,*PNode;typedef struct { PNode front...

LinkStack.h#pragma once#include <stdlib.h>#define SElemType char#define ERROR -1#define OVERFLOW -2typedef struct L_Stack{ SElemType data; struct L_Stack* next;}*Stk,Stack;/**以链表...

S_Stack.h#pragma once#include <stdlib.h>#include <stdio.h>//栈数据类型#define SElemType char//栈初始大小#define SSize 5//栈扩容增量#define SInc 5//内存溢出异常#define OVERFLOW -2//错误#define ER...

LinkList.h#pragma oncetypedef int SDataType;//链表节点 typedef struct SListNode { SDataType _data; struct SListNode* _PNext;}Node,*PNode;typedef struct SList { //封装链表结构，类似于头节点 PNode _pHead;//指...