<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[stmfresher的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/stmfresher</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; stmfresher]]></copyright><item><title><![CDATA[算法训练营day72]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/140449902</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/140449902</guid><author>stmfresher</author><pubDate>Tue, 16 Jul 2024 10:17:34 +0800</pubDate><description><![CDATA[【代码】算法训练营day72。]]></description><category></category></item><item><title><![CDATA[算法训练营day71]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/140278958</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/140278958</guid><author>stmfresher</author><pubDate>Mon, 08 Jul 2024 22:17:31 +0800</pubDate><description><![CDATA[最小生成树-Kruskal 算法。最小生成树-prim算法。]]></description><category></category></item><item><title><![CDATA[算法训练营day70]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/140226129</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/140226129</guid><author>stmfresher</author><pubDate>Sat, 06 Jul 2024 15:43:38 +0800</pubDate><description><![CDATA[三种情况：入度为2的时候，有两种情况一种是删哪个都行，另一种是删掉之后可能出现环，这时候就要判断删除这个边，是否成环了。如果没有入度为2，就是成环，这个从前向后遍历，通过查并集删除删除连通的即可。]]></description><category></category></item><item><title><![CDATA[算法训练营day69]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/140217903</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/140217903</guid><author>stmfresher</author><pubDate>Fri, 05 Jul 2024 20:52:05 +0800</pubDate><description><![CDATA[【代码】算法训练营day69。]]></description><category></category></item><item><title><![CDATA[算法训练营day67]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/140162776</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/140162776</guid><author>stmfresher</author><pubDate>Wed, 03 Jul 2024 22:39:50 +0800</pubDate><description><![CDATA[【代码】算法训练营day67。]]></description><category></category></item><item><title><![CDATA[算法训练营day66-孤岛总面积-沉没孤岛-水流问题-建造最大岛屿]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139867880</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139867880</guid><author>stmfresher</author><pubDate>Fri, 21 Jun 2024 22:52:00 +0800</pubDate><description><![CDATA[【代码】算法训练营day66-孤岛总面积-沉没孤岛-水流问题-建造最大岛屿。]]></description><category></category></item><item><title><![CDATA[算法训练营day65-岛屿连同问题]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139839269</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139839269</guid><author>stmfresher</author><pubDate>Thu, 20 Jun 2024 19:47:41 +0800</pubDate><description><![CDATA[【代码】算法训练营day65-岛屿连同问题。]]></description><category></category></item><item><title><![CDATA[算法训练营64-图论-深度优先优先搜索（dfs）-广度优先搜索（bfs）]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139814260</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139814260</guid><author>stmfresher</author><pubDate>Wed, 19 Jun 2024 22:14:02 +0800</pubDate><description><![CDATA[【代码】算法训练营65-图论-深度优先优先搜索（dfs）-广度优先搜索（bfs）]]></description><category></category></item><item><title><![CDATA[算法训练营day63]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139766556</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139766556</guid><author>stmfresher</author><pubDate>Tue, 18 Jun 2024 11:22:50 +0800</pubDate><description><![CDATA[【代码】算法训练营day63。]]></description><category></category></item><item><title><![CDATA[算法训练营补签day25]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139749178</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139749178</guid><author>stmfresher</author><pubDate>Mon, 17 Jun 2024 17:48:57 +0800</pubDate><description><![CDATA[【代码】算法训练营补签day25。]]></description><category></category></item><item><title><![CDATA[算法训练营day62]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139738685</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139738685</guid><author>stmfresher</author><pubDate>Mon, 17 Jun 2024 13:08:35 +0800</pubDate><description><![CDATA[在上一题的基础上加了一个，map确定  数组num1里元素最右边的值。真 暴力解法，但会超时。]]></description><category></category></item><item><title><![CDATA[算法训练营day60]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139727552</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139727552</guid><author>stmfresher</author><pubDate>Sun, 16 Jun 2024 22:47:03 +0800</pubDate><description><![CDATA[【代码】算法训练营day60。]]></description><category></category></item><item><title><![CDATA[算法训练营day59]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139685517</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139685517</guid><author>stmfresher</author><pubDate>Fri, 14 Jun 2024 22:23:56 +0800</pubDate><description><![CDATA[这里的初始化第一列为1，表示t是空字符串 在s的子序列中有1种情况。]]></description><category></category></item><item><title><![CDATA[算法训练营day24]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139659938</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139659938</guid><author>stmfresher</author><pubDate>Thu, 13 Jun 2024 21:47:04 +0800</pubDate><description><![CDATA[可以用二叉树最近公共祖先来做。]]></description><category></category></item><item><title><![CDATA[算法训练营day58]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139655145</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139655145</guid><author>stmfresher</author><pubDate>Thu, 13 Jun 2024 15:25:25 +0800</pubDate><description><![CDATA[动态规划，其实和之前最长公共子序列一样，只不过最后就是比较以下dp数组的值是否和字符串s的长度相同。]]></description><category></category></item><item><title><![CDATA[算法训练营day23补签]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139629023</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139629023</guid><author>stmfresher</author><pubDate>Wed, 12 Jun 2024 15:53:44 +0800</pubDate><description><![CDATA[在递归里操作，主要就是更新maxcount 然后要把reslut也更新。]]></description><category></category></item><item><title><![CDATA[算法训练题day57]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139620314</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139620314</guid><author>stmfresher</author><pubDate>Wed, 12 Jun 2024 11:55:50 +0800</pubDate><description><![CDATA[不太一样，如果是连续的那代码就一样了，这里的区别就在于如果两个字符不相等，应该取max(dp[i - 1][j], dp[i][j - 1])这道题其实可以转换成寻找两个数组中不连续的子序列的最大长度，就和上题一样了。其实动态规划和贪心的本质上都是一样的。这道题的子序列是不连续的，所以很。]]></description><category></category></item><item><title><![CDATA[算法训练营day56]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139608806</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139608806</guid><author>stmfresher</author><pubDate>Tue, 11 Jun 2024 22:17:03 +0800</pubDate><description><![CDATA[【代码】算法训练营day56。]]></description><category></category></item><item><title><![CDATA[算法训练营day53]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139588666</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139588666</guid><author>stmfresher</author><pubDate>Tue, 11 Jun 2024 10:05:56 +0800</pubDate><description><![CDATA[这道题就是在  买卖股票Ⅱ上多了一个手续费而已。]]></description><category></category></item><item><title><![CDATA[算法训练营day52]]></title><link>https://blog.youkuaiyun.com/stmfresher/article/details/139582326</link><guid>https://blog.youkuaiyun.com/stmfresher/article/details/139582326</guid><author>stmfresher</author><pubDate>Mon, 10 Jun 2024 21:47:27 +0800</pubDate><description><![CDATA[【代码】算法训练营day52。]]></description><category></category></item></channel></rss>