数据结构
Deutschester
初入职场的互联网新人,正在快速成长中……
展开
-
hashtable(哈希表)
#include #define maxsize 100#define NULLKEY -1#define DELKEY -2typedef int KeyType;typedef char* InfoType;typedef struct{ KeyType key; InfoType data; int count;} HashTable[maxsize];void InsertH原创 2010-01-06 11:08:00 · 1077 阅读 · 0 评论 -
顺序栈
<br /> <br />#include <iostream><br />#include <assert.h><br />using namespace std;<br />const int maxsize = 100;<br />const int stackIncreament = 20; //栈溢出时扩展空间的增量<br />template<class T><br />class SeqStack<br />{<br />public:<br /> SeqStack(int sz = 100)原创 2010-06-03 22:35:00 · 674 阅读 · 0 评论