<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[pinglejun的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/pinglejun</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; pinglejun]]></copyright><item><title><![CDATA[问题解决：OMP: Error #15: Initializing libiomp5md.dll, but found libiomp5md.dll already initialized.]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/147078258</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/147078258</guid><author>pinglejun</author><pubDate>Tue, 08 Apr 2025 21:43:25 +0800</pubDate><description><![CDATA[在虚拟环境路径下有两个库文件，将路径在bin文件夹下的移到其他地方或者删除即可。]]></description><category></category></item><item><title><![CDATA[EMA注意力机制]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/147066580</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/147066580</guid><author>pinglejun</author><pubDate>Tue, 08 Apr 2025 20:28:09 +0800</pubDate><description><![CDATA[EMA注意力机制]]></description><category></category></item><item><title><![CDATA[Leetcode刷题笔记1 图论part07]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146504999</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146504999</guid><author>pinglejun</author><pubDate>Tue, 25 Mar 2025 15:47:38 +0800</pubDate><description><![CDATA[prim算法核心就是三步，称为。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记 图论part06]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146504907</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146504907</guid><author>pinglejun</author><pubDate>Tue, 25 Mar 2025 15:41:10 +0800</pubDate><description><![CDATA[并查集的进一步应用。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记 图论part05]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146478295</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146478295</guid><author>pinglejun</author><pubDate>Mon, 24 Mar 2025 15:51:26 +0800</pubDate><description><![CDATA[【代码】Leetcode 刷题笔记 图论part05。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 图论part04]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146436856</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146436856</guid><author>pinglejun</author><pubDate>Sat, 22 Mar 2025 11:24:34 +0800</pubDate><description><![CDATA[【代码】Leetcode 刷题笔记1 图论part04。]]></description><category></category></item><item><title><![CDATA[Leetcode刷题笔记1 图论part03]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146423203</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146423203</guid><author>pinglejun</author><pubDate>Sat, 22 Mar 2025 09:53:39 +0800</pubDate><description><![CDATA[【代码】Leetcode刷题笔记1 图论part03]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 图论part02]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146374182</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146374182</guid><author>pinglejun</author><pubDate>Wed, 19 Mar 2025 16:33:12 +0800</pubDate><description><![CDATA[【代码】Leetcode 刷题笔记1 图论part02。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 图论part01]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146343621</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146343621</guid><author>pinglejun</author><pubDate>Tue, 18 Mar 2025 15:51:29 +0800</pubDate><description><![CDATA[有向图（边有方向） 、 无向图（边无方向）、加权有向图（边有方向和权值）无向图中几条边连接该节点，该节点就有几度；有向图中每个节点有入度和出度在无向图中，任何两个节点都是可以到达的，称之为连通图，否则称之为非连通图在有向图中，热河两个节点是可以相互到达的，称之为强连通图在无向图中的连通子图称之为该图的一个连通分量有向图中强连通子图称之为强连通分量一般使用邻接表、邻接矩阵和朴素存储深度优先搜索（dfs）、广度优先搜索（bfs）]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 单调栈part02]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146324674</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146324674</guid><author>pinglejun</author><pubDate>Mon, 17 Mar 2025 22:02:37 +0800</pubDate><description><![CDATA[本题用双指针法更为浅显易懂。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 单调栈part01]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146311126</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146311126</guid><author>pinglejun</author><pubDate>Mon, 17 Mar 2025 20:13:29 +0800</pubDate><description><![CDATA[对于单调栈问题，我觉得是在循环外部增加一些辅助项减少时间复杂度，但增加内存空间的利用。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 动态规划part13]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146251933</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146251933</guid><author>pinglejun</author><pubDate>Fri, 14 Mar 2025 11:50:56 +0800</pubDate><description><![CDATA[【代码】Leetcode 刷题笔记1 动态规划part13。]]></description><category></category></item><item><title><![CDATA[Leetcode刷题笔记1 动态规划part12]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146231720</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146231720</guid><author>pinglejun</author><pubDate>Thu, 13 Mar 2025 16:06:40 +0800</pubDate><description><![CDATA[在子序列问题中，遇到不匹配的情况时，哪个子序列长，哪个子序列让步，如果不知道哪个长就直接max(dp[i - 1][j], dp[i][j - 1])]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 动态规划part11]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146206199</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146206199</guid><author>pinglejun</author><pubDate>Wed, 12 Mar 2025 15:59:46 +0800</pubDate><description><![CDATA[动态规划]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 动态规划part10]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146172198</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146172198</guid><author>pinglejun</author><pubDate>Tue, 11 Mar 2025 11:36:46 +0800</pubDate><description><![CDATA[递推公式：dp[i] = max(dp[i], dp[j] + 1)]]></description><category></category></item><item><title><![CDATA[Leetcode刷题笔记1 动态规划part09]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146155972</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146155972</guid><author>pinglejun</author><pubDate>Mon, 10 Mar 2025 16:47:28 +0800</pubDate><description><![CDATA[【代码】Leetcode刷题笔记1 动态规划part09。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 动态规划part08]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146148180</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146148180</guid><author>pinglejun</author><pubDate>Mon, 10 Mar 2025 15:05:38 +0800</pubDate><description><![CDATA[把股票问题理解为不卖和卖的两种情况，就只需要考虑两个变量即可。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 动态规划part07]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146089312</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146089312</guid><author>pinglejun</author><pubDate>Fri, 07 Mar 2025 17:04:41 +0800</pubDate><description><![CDATA[一轮循环，确定递归公式即可ac。]]></description><category></category></item><item><title><![CDATA[Leetcode 刷题笔记1 动态规划part06]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146060892</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146060892</guid><author>pinglejun</author><pubDate>Thu, 06 Mar 2025 11:05:53 +0800</pubDate><description><![CDATA[由于本题所求为最少零钱数所以递推公式中应该为dp[ j ] = min(dp[ j ], dp[ j - coin] + 1)]]></description><category></category></item><item><title><![CDATA[基础--素因数]]></title><link>https://blog.youkuaiyun.com/pinglejun/article/details/146046337</link><guid>https://blog.youkuaiyun.com/pinglejun/article/details/146046337</guid><author>pinglejun</author><pubDate>Wed, 05 Mar 2025 16:26:00 +0800</pubDate><description><![CDATA[素因数--]]></description><category></category></item></channel></rss>