m0_52132501的博客

原创 图片哈哈哈

原创 构建哈夫曼树（半成品）

https://www.bjfuacm.com/problem/262#define _CRT_SECURE_NO_WARNINGS#include<iostream>#include<string.h>using namespace std;struct HTNode{ int left; int right; int parent; int weight; };typedef HTNode* HuffmanTree;vo...

原创 基于二叉链表的树结构相等的判断

#include<iostream>#include<fstream>#include<string>#include<cmath>#include<map>#include<algorithm>#include<string.h>#include<vector>#include<stack>using namespace std;struct tree { tr...

原创 约瑟夫环 _c++实现

#include<iostream>#include<fstream>#include<string>#include<cmath>#include<map>#include<algorithm>#include<string.h>#include<vector>#include<assert.h>#include<stack>using namespace std;