<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_51669971的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_51669971</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_51669971]]></copyright><item><title><![CDATA[动态规划LeetCode]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/142455577</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/142455577</guid><author>m0_51669971</author><pubDate>Mon, 23 Sep 2024 13:02:44 +0800</pubDate><description><![CDATA[LeetCode 377（完全背包问题）]]></description><category></category></item><item><title><![CDATA[2023河海大学838计算机专硕考研经验贴]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/130731492</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/130731492</guid><author>m0_51669971</author><pubDate>Wed, 17 May 2023 17:45:56 +0800</pubDate><description><![CDATA[数学：高数我基础阶段看的张宇老师的视频，做了基础300题和1800基础篇。暑假是复习的黄金时期，我在暑假看的张宇的强化课，做的1000题（1000题部分题目偏难，跟真题风格不一样，建议对数学分数目标较高的使用1000题）。今年专业课题型相比往年有所变化，最突出的特点是取消了填空题，大题题量变大。写在前面：河海是一个性价比很高的211，而且是出了名的公平（这点我深有体会，本校的也没比外校有什么优势。本人23考研，初试400+，已拟录取，闲来无事特意写一个经验贴帮助有意向考河海的学弟学妹。]]></description><category></category></item><item><title><![CDATA[用c语言编写递归函数，将数字字符串转换成一个整数]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/129290615</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/129290615</guid><author>m0_51669971</author><pubDate>Wed, 01 Mar 2023 21:46:36 +0800</pubDate><description><![CDATA[【代码】用c语言编写递归函数，将数字字符串转换成一个整数。]]></description><category></category></item><item><title><![CDATA[c语言分解质因数代码]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/129269798</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/129269798</guid><author>m0_51669971</author><pubDate>Tue, 28 Feb 2023 21:19:25 +0800</pubDate><description><![CDATA[算术基本定理：任何一个大于1的正整数都能分解为有限个质数的幂的乘积 ：N=pc11pc22⋅⋅⋅pcmm 其中都是ci正整数，pi都是质数，且满足 p1]]></description><category></category></item><item><title><![CDATA[解决springboot项目发布后不能保持运行，Linux下保持jar包在后台运行]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/128699489</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/128699489</guid><author>m0_51669971</author><pubDate>Mon, 16 Jan 2023 00:12:52 +0800</pubDate><description><![CDATA[当用 nohub命令启动 jar 包的时候，如果不指定日志输出文件，则所有的输出都会被重定向到 nohub.out 的文件中。用 nohub 命令启动 jar 包，是在后台不挂断运行，关闭终端窗口或者 CTRL + C 命令也不会终止程序。]]></description><category></category></item><item><title><![CDATA[中序线索二叉树遍历（带头结点和不带头结点）]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/127504166</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/127504166</guid><author>m0_51669971</author><pubDate>Mon, 24 Oct 2022 22:54:20 +0800</pubDate><description><![CDATA[【代码】中序线索二叉树遍历（带头结点和不带头结点）]]></description><category></category></item><item><title><![CDATA[找二叉树两个节点的公共祖先]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/127473747</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/127473747</guid><author>m0_51669971</author><pubDate>Sun, 23 Oct 2022 13:21:35 +0800</pubDate><description><![CDATA[【代码】找二叉树两个节点的公共祖先。]]></description><category></category></item><item><title><![CDATA[找二叉树根节点到叶子结点最长路径]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/127469529</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/127469529</guid><author>m0_51669971</author><pubDate>Sat, 22 Oct 2022 23:45:55 +0800</pubDate><description><![CDATA[【代码】找二叉树根节点到叶子结点最长路径。]]></description><category></category></item><item><title><![CDATA[判断二叉排序树，平衡二叉树]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126653444</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126653444</guid><author>m0_51669971</author><pubDate>Thu, 01 Sep 2022 23:43:44 +0800</pubDate><description><![CDATA[【代码】判断二叉排序树，平衡二叉树。]]></description><category></category></item><item><title><![CDATA[深度优先遍历拓扑排序]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126515141</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126515141</guid><author>m0_51669971</author><pubDate>Wed, 24 Aug 2022 23:58:27 +0800</pubDate><description><![CDATA[【代码】深度优先遍历拓扑排序。]]></description><category></category></item><item><title><![CDATA[拓扑排序c语言实现]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126514684</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126514684</guid><author>m0_51669971</author><pubDate>Wed, 24 Aug 2022 23:17:22 +0800</pubDate><description><![CDATA[【代码】拓扑排序c语言实现。]]></description><category></category></item><item><title><![CDATA[dijkstra算法c语言实现]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126458060</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126458060</guid><author>m0_51669971</author><pubDate>Mon, 22 Aug 2022 00:59:17 +0800</pubDate><description><![CDATA[【代码】dijkstra算法c语言实现。]]></description><category></category></item><item><title><![CDATA[图两点间所有最简单路径]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126377117</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126377117</guid><author>m0_51669971</author><pubDate>Wed, 17 Aug 2022 00:50:25 +0800</pubDate><description><![CDATA[代码】图两点间所有最简单路径。]]></description><category></category></item><item><title><![CDATA[图的遍历方式（递归加非递归）总结（深度优先遍历和广度优先遍历）C语言]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126376329</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126376329</guid><author>m0_51669971</author><pubDate>Tue, 16 Aug 2022 23:37:05 +0800</pubDate><description><![CDATA[图的遍历方式（递归加非递归）总结（深度优先遍历和广度优先遍历）C语言。]]></description><category></category></item><item><title><![CDATA[以邻接矩阵表示的图的非递归深度优先遍历]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126357498</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126357498</guid><author>m0_51669971</author><pubDate>Tue, 16 Aug 2022 00:48:22 +0800</pubDate><description><![CDATA[以邻接矩阵表示的图的非递归深度优先遍历。]]></description><category></category></item><item><title><![CDATA[王道P175 T6，已知一棵树的层次序列及每个节点的度，构造其孩子兄弟链表]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126326215</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126326215</guid><author>m0_51669971</author><pubDate>Sat, 13 Aug 2022 23:51:55 +0800</pubDate><description><![CDATA[代码】王道P175 T6，已知一棵树的层次序列及每个节点的度，构造其孩子兄弟链表。]]></description><category></category></item><item><title><![CDATA[王道P175 T5，求以孩子兄弟链表表示的树的深度]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126187073</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126187073</guid><author>m0_51669971</author><pubDate>Fri, 05 Aug 2022 22:54:04 +0800</pubDate><description><![CDATA[以孩子兄弟链表存储，树的深度等于max(左子树的深度加+1,右树深度),因为此时的右孩子对应的是原来树中该结点临近的兄弟，它们位于同一层次。]]></description><category></category></item><item><title><![CDATA[王道P175 T4，求孩子兄弟表示法存储的森林的叶子结点数]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126186939</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126186939</guid><author>m0_51669971</author><pubDate>Fri, 05 Aug 2022 22:43:42 +0800</pubDate><description><![CDATA[求以二叉链表存储的森林的叶子结点个数，叶子结点即没有孩子的结点。]]></description><category></category></item><item><title><![CDATA[表达式树转中缀表达式，王道P150 T20]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126079566</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126079566</guid><author>m0_51669971</author><pubDate>Sat, 30 Jul 2022 23:52:26 +0800</pubDate><description><![CDATA[叶子结点和根节点不用加括号。]]></description><category></category></item><item><title><![CDATA[将二叉树的叶子结点按照从左到右的顺序连接一个单链表，表头指针为head]]></title><link>https://blog.youkuaiyun.com/m0_51669971/article/details/126079409</link><guid>https://blog.youkuaiyun.com/m0_51669971/article/details/126079409</guid><author>m0_51669971</author><pubDate>Sat, 30 Jul 2022 23:30:50 +0800</pubDate><description><![CDATA[将二叉树的叶子结点按照从左到右的顺序连接一个单链表，表头指针为head。]]></description><category></category></item></channel></rss>