数据结构
CetXiyuan
这个作者很懒,什么都没留下…
展开
-
一种基于hash算法的容器接口(适用于所有类hash算法的数据存储处理)
/** File name : xy_chash_source.c** Created on : 2019年10月11日14:40:24* Author : Firmware of xiyuan255* Version : 2.0* Language : C* Copyright : Copyright (C)...原创 2020-04-29 11:51:44 · 247 阅读 · 0 评论 -
一种基于双向链表设计的list数据存储操作接口(加入类迭代器设计)
/** File name : xy_list_code.c** Created on : 2019年8月29日10:39:35* Author : Firmware of xiyuan255* Version : 2.0* Language : C* Copyright : Copyright (C) 2...原创 2020-04-29 11:54:10 · 138 阅读 · 0 评论 -
一种基于双向链表设计的map数据存储操作接口(加入类迭代器设计)
/* * File name : xy_list_code.c * * Created on : 2019年8月29日10:39:35 * Author : Firmware of xiyuan255 * Version : 2.0 * Language : C * Copyright : Copyright (C) 2019, xiyuan255 Inc. * */...原创 2020-04-29 11:56:47 · 150 阅读 · 0 评论 -
循环链表.c
#define NULL ((void *)0)#define MALLOC(dataType, n) malloc( sizeof(dataType)*n )#define SCANF(pVal, val) scanf("%d", &val)#define FREE(Point) free(Point)#define EXIT(val) ...原创 2018-02-08 08:44:16 · 189 阅读 · 0 评论 -
循环队列(内核为循环链表).c
#define NULL ((void *)0)#define MALLOC(dataType, n) malloc( sizeof(dataType)*n )#define SCANF(pVal, val) scanf("%d", &val)#define FREE(Point) free(Point)typedef struct Node{ int...原创 2018-02-08 08:44:12 · 348 阅读 · 0 评论 -
队列(内核为单链表).c
#define NULL ((void *)0)#define MALLOC(dataType, n) malloc( sizeof(dataType)*n )#define SCANF(pVal, val) scanf("%d", &val)#define FREE(Point) free(Point)typedef struct Node{ int dat原创 2017-03-13 20:04:34 · 249 阅读 · 0 评论 -
链表程序.c
#define MALLOC(dataType) malloc( sizeof(dataType) )#define SCANF(pVal, val) scanf("%d", &val)#define FREE(Point) free(Point)typedef struct Node{ int data; struct Node *pNext;}NODE_T原创 2017-03-13 20:42:45 · 220 阅读 · 0 评论 -
循环队列(内核为链表).c
#define NULL ((void *)0)#define MALLOC(dataType, n) malloc( sizeof(dataType)*n )#define SCANF(pVal, val) scanf("%d", &val)#define FREE(Point) free(Point)typedef struct Node{ int dat原创 2017-03-13 20:45:07 · 424 阅读 · 0 评论 -
循环队列(内核为数组存储).c
#define MALLOC(dataType, n) malloc( sizeof(dataType)*n )#define SCANF(pVal, val) scanf("%d", &val)#define FREE(Point) free(Point)typedef struct Queue{ int * pBase; int front; int rea原创 2017-03-13 20:49:24 · 311 阅读 · 0 评论 -
栈的模拟(内核为链表).c
typedef struct Node{ int data; struct Node *pNext;}NODE_T, *PNODE_T;typedef struct Stack{ PNODE_T pTop; PNODE_T pBottom;}STACK_T, *PSTACK_T;void Init_Stack(PSTACK_T pStack);bool Push_Stack(原创 2017-03-13 20:53:36 · 303 阅读 · 0 评论 -
栈的模拟(内核为数组).c
#define NULL ((void *)0)#define MALLOC(dataType, n) malloc( sizeof(dataType)*n )#define SCANF(pVal, val) scanf("%d", &val)#define FREE(Point) free(Point)typedef struct Stack_Array{原创 2017-03-13 20:56:08 · 339 阅读 · 0 评论