w5206666的博客

线性表的应用:链栈基本操作#include<stdio.h>#include<stdlib.h>typedef struct Linknode{ int data; struct Linknode *next;}Linknode,*LiStack;// 初始化链栈void InitLiStack(LiStack &LS){ LS = NULL;}// 入栈bool Push(LiStack &LS,int e){

线性表的应用:顺序栈的基本操作#include<stdio.h>#define MaxSize 10typedef struct SqStack{ int data[MaxSize]; int top;}SqStack;// 初始化栈bool InitSqStack(SqStack &S){ S.top = -1; return true;}// 判断栈是否为空bool StackEmpty(SqStack &S){

线性表的应用：一、顺序表的基本操作(动态分配)#include<stdio.h>#include<stdlib.h>typedef struct LNode{ int data; struct LNode *next;}LNode,*LinkList;// 初始化链表bool InitList(LinkList &L){ L = (LNode *)malloc(sizeof(LNode)); if(L==NULL){

#include<stdio.h>#include<stdlib.h>#define InitSize 10typedef struct DynamicSqlList{ /* data */ int *data; int MaxSize; int length;}DynamicSqlList;// 生成顺序表的测试数据void InitListData(DynamicSqlList &L){ L.data = (i

#include<stdio.h>#include<stdlib.h>#define MaxSize 10typedef struct { int data[MaxSize]; int length;}StaticSqlList;// 初始化顺序表void InitList(StaticSqlList &L){ for (int i = 0; i < 6; i++){ L.data[i] = i+1;