数据结构—代码
Hewding
这个作者很懒,什么都没留下…
展开
-
队列—顺序结构(循环队列)
#include<stdio.h> #define Maxsize 5 #define OK 1 typedef int QElemtype; typedef int Status; typedef struct { QElemtype data[Maxsize]; QElemtype front; QElemtype rear; }SqQueue; SqQueue* Q; Status InitQueue(SqQueue* Q) //初始化,输出队列 { scanf_s("%d"原创 2020-07-01 20:51:13 · 108 阅读 · 0 评论 -
栈—顺序结构
#include<stdio.h> #define OK 1 #define Maxsize 10 typedef int SElemtype; typedef int Status; typedef struct { SElemtype data[Maxsize]; SElemtype top; }StackList; StackList* S; Status InitStack(StackList* S) //初始化栈 { scanf_s("%d", &S->da原创 2020-06-30 17:53:43 · 73 阅读 · 0 评论 -
栈—链式结构
#include<stdio.h> #define OK 1 typedef int SElemtype; typedef int Status; typedef struct StackNode { SElemtype data; struct StackNode* next; }StackNode,*LinkStackPtr; StackNode* s, * head; //用于栈中的结点 //用于创造结点 typedef struct LinkStack { LinkStac原创 2020-06-30 16:41:25 · 82 阅读 · 0 评论