<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ffff_uck的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ffff_uck</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ffff_uck]]></copyright><item><title><![CDATA[JDBC连接MySql数据库（包含Druid、DbUtils）流程控制及API详解]]></title><link>https://blog.youkuaiyun.com/ffff_uck/article/details/127108450</link><guid>https://blog.youkuaiyun.com/ffff_uck/article/details/127108450</guid><author>ffff_uck</author><pubDate>Fri, 30 Sep 2022 08:18:19 +0800</pubDate><description><![CDATA[JDBC连接MySql数据库（包含Druid、DbUtils）流程控制及API详解]]></description><category></category></item><item><title><![CDATA[哈夫曼树的创建（输入权值）与遍历]]></title><link>https://blog.youkuaiyun.com/ffff_uck/article/details/103190544</link><guid>https://blog.youkuaiyun.com/ffff_uck/article/details/103190544</guid><author>ffff_uck</author><pubDate>Fri, 22 Nov 2019 17:39:54 +0800</pubDate><description><![CDATA[哈夫曼树的创建加粗样式
欢迎使用Markdown编辑在这里插入代码片器
#include &lt;iostream&gt;
#include &lt;malloc.h&gt;
using namespace std;

//分别定义叶子节点，一度节点，二度节点数量，并初始化为0
int Node_0 = 0, Node_1 = 0, Node_2 = 0;

//哈夫曼树结点结构体
struct ...]]></description><category></category></item></channel></rss>