封尘浪

/*----------------------------------------------------------------------------------------------- * Project: Heap.cpp * Name: zwp * Date: 2014/3 *----------------------------------------------

字典树 #ifndef TIRE_H_INCLUDED #define TIRE_H_INCLUDED /* ** 字典树 */ #define MAX 26 typedef struct Node { int num; struct Node* next[MAX]; }Tire; /* ** 创建一个节点 */ Tire* create(void); /* *

/*-------------------------------------------------------------------------- * Project: Sort.h * Name: zwp * Date: 2014/3 *-------------------------------------------------------------------------

/*--------------------------------------------------------------------------------------- * Project: HashQuad.h * Name: zwp * Date: 2014.3 *--------------------------------------------------------

/*------------------------------------------------------------------------------------- * Project: Queue.h * Name: zwp * Date: 2014/3 *-------------------------------------------------------------

什么叫真正理解一种数据结构，那就是在敲代码时，完全不看书，靠记忆力，纸和笔推导，一步步调试无错为止。 /*------------------------------------------------------------------------------------- * Project: List.c * Name: zwp * Date: 2014/4 *------

/*-------------------------------------------------------------------------------------- * Project: Main.cpp * Name: zwp * Date: 2014/4 *-----------------------------------------------------------

专栏申请成功了，挺高兴的，以后好好努力，将自己的数据结构与算法学习之路雕刻与此！   /*--------------------------------------------------------------------------------- * Project: Stack.h * Name: zwp * Date: 2014/3 *----------------