![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
coding的乐趣
专注于 敏捷开发,系统架构, 项目管理
展开
-
线性表的顺序存储算法
#define MaxSize 50 #define ERROR 0; #define OK 1; typedef int ElemType; typedef struct sqlList { ElemType data[MaxSize]; int length; }SqList; void InitList(SqList *L) { printf("InitList\n"); L->length =0; } int GetElem(SqLi.原创 2020-05-24 21:25:33 · 237 阅读 · 0 评论 -
数据结构之栈的链式存储结构实现-c语言版
#define OK 1 #define ERROR -1 #define NULL 0 typedef int ElemType; typedef int Status; typedef struct Stack_Node { ElemType data; struct Stack_Node *next; }Stack_Node; Stack_Node *Init_Link_Stack(void) { Stack_Node *top; top = (Stack_Nod.原创 2020-05-16 16:21:54 · 215 阅读 · 0 评论 -
数据结构之栈的静态顺序存储实现-c语言版
#define MAX_STACK_SIZE 100 /* 栈向量大小 */ #define OK 1 #define ERROR -1 typedef int ElemType; typedef int Status; typedef struct sqstack { ElemType stack_array[MAX_STACK_SIZE]; int top; }SqStack; /* 栈的初始化*/ SqStack Init_Stack(void) { SqStack S;.原创 2020-05-16 16:00:36 · 273 阅读 · 0 评论 -
数据结构之栈的动态顺序存储实现-c语言版
#include <stdio.h> #define STACK_SIZE 100 #define STACK_INCREMENT 10 typedef int ElemType; typedef int Status; #define OK 1 #define ERROR -1 typedef struct sqstack { ElemType *bottom; ElemType *top; int stackSize; }SqStack,*Pstack; Sta...原创 2020-05-16 15:24:15 · 292 阅读 · 0 评论