oliver233的博客

#include#include#include#include#includeusing namespace std;#define Max 20int visited[Max]={0};int indegree[Max]={0};typedef struct ArcNode{ int adj; struct ArcNode *nextarc;}Arc

#include#includetypedef struct { char string[100]; int length;}String;int next[100];void getnext(String p){ int i,j; next[0]=-1; i=0; j=-1; while(i<p.length){ if(j==-1||p.string[i]=

#include#includetypedef struct Node{ int data; struct Node *Lchild; struct Node *Rchild;}T_Node,*BiTree;void Insert(BiTree &T,int data){ BiTree p,parent,s; p=T; while(p)

#include#include#include#includeusing namespace std;int len1=0;int len2=0;typedef struct node{ int valum; struct node *next;}Node,*Linklist;void creat_list(Linklist &head,int n){

#include#include#define Max 20int visited[20];typedef struct { char vex[Max]; int vexs[Max][Max]; int vexnum,arcnum;}MGraph;typedef struct { char adjvex; int lowcost;}closest;int L

#include#define maxnum 1000.0#define maxsize 100typedef struct{ char ch; float weight; int lchild,rchild,parent;}hufftree;typedef struct{ char coder[maxsize]; int start;

字典树是做字符串匹配的常用数据结构，它是根据公共前缀来进行匹配，大大减少了类似线性的匹配时间根节点为空每个新建立的节点有26个指针域由每一个指针域进行向下的建立和查询模板题：统计难题Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others)Tot

#include#include#define length 100#define add 10typedef struct size{ int *top; int *basic; int stacksize;}Stacks;void InitStacks(Stacks &S){ S.basic=(int *)malloc(length * sizeof(int));

//图的邻接矩阵构造方法，以及DFS，BFS操作；#include#include#includeusing namespace std;#define Max 20int visited[20];typedef struct { char vex[Max]; int vexs[Max][Max]; int vexnum,arcnum;}MGraph;int L

#include#include#include#includeusing namespace std;typedef struct node{ char data; struct node *Lchild; struct node *Rchild;}Bt_Tree,*Tree;void Init_Tree(Tree &tree){ char ch; scanf

#include#include#include#define length 100#define add 10typedef struct size{ char *top; char *basic; int stacksize;}Stacks;void InitStacks(Stacks &S){ S.basic=(char *)malloc(length * siz

#include#include#define length 100#define addlength 10typedef struct{ int *eum; int legth; int size;}List;void Initlist(List &L,int n){ //初始化链表 int i; L.eum = (int *)malloc(length * s

#include#include//stl中队列的应用using namespace std;int main(){ queueQ;//生成存储int型的队列 int i; for(i=1;i<=5;i++) Q.push(i);//将元素放进队列； printf("%d\n",Q.size());//输出队列的大小； printf("%d ",Q.front())

#include#include//栈标准库//利用STL库进行栈的基本操作using namespace std;//使用存储空间int main(){ stackS;//生成栈S； int i; int n=5; for(i=0;i<5;i++) S.push(i);//栈的压入操作； int size; size=S.size(); printf("%d\n

#include#includetypedef struct list{ int data; struct list *next;}List,*LinkList;//定义结构体指针，便于直接用指针来修改位置//避免 struct List * ptr;void TailCreat(LinkList &L,int n){ //尾插法建立链表 LinkList ptr,p

#include#include#define length 100#define add 10typedef struct size{ int *top; int *basic; int stacksize;}Stacks;void InitStacks(Stacks &S){ S.basic=(int *)malloc(length * sizeof(int));

现有的排序方法中，最快的快排的时间复杂度是NlogN，但是，面对数据量差比较小的大量数据来说，往往这样的时间复杂度是不够的，例如学生的成绩，等大规模整数数据，所以利用哈希散列的排序方法，可以用充足的空间复杂度，来换取更快的时间复杂度，（前提是：整数，且数据之间相差不大）具体思想看代码就能看懂import java.util.Scanner;public class HashSort {