https://blog.youkuaiyun.com/KSMasterzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/KSMaster/article/details/104397151https://blog.youkuaiyun.com/KSMaster/article/details/104397151KSMasterFri, 06 Mar 2020 16:47:05 +0800https://blog.youkuaiyun.com/KSMaster/article/details/103319999https://blog.youkuaiyun.com/KSMaster/article/details/103319999KSMasterSat, 30 Nov 2019 01:17:43 +0800https://blog.youkuaiyun.com/KSMaster/article/details/79971888https://blog.youkuaiyun.com/KSMaster/article/details/79971888KSMasterSat, 23 Nov 2019 21:30:39 +0800https://blog.youkuaiyun.com/KSMaster/article/details/103208172https://blog.youkuaiyun.com/KSMaster/article/details/103208172KSMasterFri, 22 Nov 2019 22:07:18 +0800https://blog.youkuaiyun.com/KSMaster/article/details/103208114https://blog.youkuaiyun.com/KSMaster/article/details/103208114KSMasterFri, 22 Nov 2019 22:02:33 +0800https://blog.youkuaiyun.com/KSMaster/article/details/103208031https://blog.youkuaiyun.com/KSMaster/article/details/103208031KSMasterFri, 22 Nov 2019 21:58:30 +0800https://blog.youkuaiyun.com/KSMaster/article/details/80055409https://blog.youkuaiyun.com/KSMaster/article/details/80055409KSMasterMon, 23 Apr 2018 20:00:29 +0800https://blog.youkuaiyun.com/KSMaster/article/details/80055405https://blog.youkuaiyun.com/KSMaster/article/details/80055405KSMasterMon, 23 Apr 2018 20:00:21 +0800 #include using namespace s]]>https://blog.youkuaiyun.com/KSMaster/article/details/80055404https://blog.youkuaiyun.com/KSMaster/article/details/80055404KSMasterMon, 23 Apr 2018 20:00:18 +0800j的有向边就可以了，是左边向右边的匹配 //g没有边相连则初始化为0 //uN是匹配左边]]>https://blog.youkuaiyun.com/KSMaster/article/details/80055402https://blog.youkuaiyun.com/KSMaster/article/details/80055402KSMasterMon, 23 Apr 2018 20:00:16 +0800https://blog.youkuaiyun.com/KSMaster/article/details/80055400https://blog.youkuaiyun.com/KSMaster/article/details/80055400KSMasterMon, 23 Apr 2018 20:00:13 +0800 #include #include struct head { unsigned char b; //记录字符在数组中的位置 long count; //字符出现频率（权值） long parent,lch,rch; //定义哈夫曼树指针变量 ]]>https://blog.youkuaiyun.com/KSMaster/article/details/80055399https://blog.youkuaiyun.com/KSMaster/article/details/80055399KSMasterMon, 23 Apr 2018 20:00:11 +0800 #include #define MAXNUM 60 typedef struct { char ch; int weight; //权值，这个字符出现的频率 int parent; int left; int right; }HuffNode; t]]>https://blog.youkuaiyun.com/KSMaster/article/details/80055396https://blog.youkuaiyun.com/KSMaster/article/details/80055396KSMasterMon, 23 Apr 2018 20:00:08 +0800https://blog.youkuaiyun.com/KSMaster/article/details/80055390https://blog.youkuaiyun.com/KSMaster/article/details/80055390KSMasterMon, 23 Apr 2018 19:59:55 +0800https://blog.youkuaiyun.com/KSMaster/article/details/80055386https://blog.youkuaiyun.com/KSMaster/article/details/80055386KSMasterMon, 23 Apr 2018 19:59:49 +0800https://blog.youkuaiyun.com/KSMaster/article/details/80055384https://blog.youkuaiyun.com/KSMaster/article/details/80055384KSMasterMon, 23 Apr 2018 19:59:46 +0800 #include #define M 100001 #define N 100 struct node //链表数组 { int id; struct node *next; }*d[M]; char a[M][N],b[M][N]; char s[N],str[N]; ]]>https://blog.youkuaiyun.com/KSMaster/article/details/80055382https://blog.youkuaiyun.com/KSMaster/article/details/80055382KSMasterMon, 23 Apr 2018 19:59:44 +0800 using namespace std; int array[16000000]; int hash[256]; char s[160000000]; #define mem(a) memset(a,0,sizeof(a)) int main() { int n,m; wh]]>https://blog.youkuaiyun.com/KSMaster/article/details/80055380https://blog.youkuaiyun.com/KSMaster/article/details/80055380KSMasterMon, 23 Apr 2018 19:59:41 +0800https://blog.youkuaiyun.com/KSMaster/article/details/80055373https://blog.youkuaiyun.com/KSMaster/article/details/80055373KSMasterMon, 23 Apr 2018 19:59:28 +0800 #include using namespace std; char a[210],b[210],c[500]; int mark[210][210]; int n; int dfs(int i,int j,int k) { if(mark[i][j]) retur]]>https://blog.youkuaiyun.com/KSMaster/article/details/80055366https://blog.youkuaiyun.com/KSMaster/article/details/80055366KSMasterMon, 23 Apr 2018 19:59:15 +0800 #include using namespace std; #define maxNum 100 //定义邻接矩阵的最大定点数 int visited[maxNum]; //通过visited数组来标记这个顶点是否被访问过，0表示未被访问，1表示被访问 //图的邻接矩阵表示结构 typede]]>