qq_53826699的博客

#include<stdio.h>#include<stdlib.h>#include<algorithm>#include<iostream>using namespace std;const int maxn=100010;int flag=1;int vis[maxn]={0};struct node{ char gender; int father,mother; node() { father=-1; moth.

//队列的顺序表示--用一维数组base[M] 循环队列#define M 100 //最大队列长度Typedef struct { QElemType *base; //初始化的动态分配存储空间 int front; //头指针 int rear; //尾指针}SqQueue; 空队标志：front= =rear入队：base[rear++]=x;出队：x=base[front++];//实现：利用“模...

typedef struct StackNode { SElemType data; struct StackNode *next;} StackNode, *LinkStack;LinkStack S; //链栈的初始化void InitStack(LinkStack &S ){ S=NULL;}//判断链栈是否为空Status StackEmpty(LinkStack S){ if (S==NULL) ...

typedef struct{ int top[2], bot[2]; //栈顶和栈底指针 　SElemType *V; //栈数组 int m; //栈最大可容纳元素个数}DblStack;void Dblpush(DblStack &s,SElemType x,int i) ；//把x插入到栈i的栈int Dblpop(DblStack &s,int i,SElemType &x) ；//退掉位于栈i栈顶的元素i...

//顺序栈的表示#define MAXSIZE 100typedef struct{ SElemType *base; SElemType *top; int stacksize;}SqStack;//顺序栈初始化Status InitStack( SqStack &S ){ S.base =new SElemType[MAXSIZE]； if( !S.base ) return OVERFLOW;...