<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_43456971的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_43456971</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_43456971]]></copyright><item><title><![CDATA[代码随想录算法训练营第六十二天 | 图论part11]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141865393</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141865393</guid><author>qq_43456971</author><pubDate>Tue, 03 Sep 2024 22:01:05 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第六十二天 | 图论part11。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第六十天 | 图论part10]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141754414</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141754414</guid><author>qq_43456971</author><pubDate>Sat, 31 Aug 2024 18:54:21 +0800</pubDate><description><![CDATA[对于Bellman_ford算法的优化，松弛n-1次，并且每一次都松弛每一条边，其实做了许多没有意义的事情。实际上只去松弛上一次计算过的节点作为出发节点的边即可。只需要记录每个节点入队列的次数，超过n-1直接输出circle然后返回。对所有边松弛一次，相当于计算 起点到达与起点同一条边的节点的最短距离。所以应该最多松弛k+1条边。并且每次松弛只能使用上次结果的副本。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十九天 | 图论part09]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141749175</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141749175</guid><author>qq_43456971</author><pubDate>Sat, 31 Aug 2024 16:08:45 +0800</pubDate><description><![CDATA[使用堆优化，从宏观角度来说就是将每条边都加入堆，一共是E条边，每次操作的时间复杂度是。Bellman_ford算法就是松弛n-1次。每一次会将所有点到源点的距离更新。使用邻接表和堆来优化dijkstra算法。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十八天 | 图论part08]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141725890</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141725890</guid><author>qq_43456971</author><pubDate>Fri, 30 Aug 2024 23:09:38 +0800</pubDate><description><![CDATA[在这一题中，只需要输出一种方法。使用BFS的方法，找到入度为0的节点，将其从树中删去，重复上述步骤，直到没有入度为0的节点。如果此时没有删除所有的节点，表明这个有向图有环，输出-1.否则，正常输出。记录到源点的距离的一维数组。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十七天 | 图论part07]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141716230</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141716230</guid><author>qq_43456971</author><pubDate>Fri, 30 Aug 2024 14:41:59 +0800</pubDate><description><![CDATA[prim算法int。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十六天 | 图论part06]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141682992</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141682992</guid><author>qq_43456971</author><pubDate>Thu, 29 Aug 2024 22:59:02 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第五十六天 | 图论part06。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十五天 | 图论part05]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141681455</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141681455</guid><author>qq_43456971</author><pubDate>Thu, 29 Aug 2024 16:23:28 +0800</pubDate><description><![CDATA[只需要判断是否联通，不需要知道具体路径或者路径数量，可以使用并查集。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十三天 | 图论part04]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141672099</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141672099</guid><author>qq_43456971</author><pubDate>Thu, 29 Aug 2024 14:09:48 +0800</pubDate><description><![CDATA[思路是要将字符串之间用线连起来，每个相邻的字符串只有一个字符不同。通过bfs来找到最短路径。要注意已经走过的路径要记录下来，包括走过的步数。但是这一题并没有建图，而是将这个过程简化了，只是记录下了path。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十二天 | 图论part03]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141642882</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141642882</guid><author>qq_43456971</author><pubDate>Wed, 28 Aug 2024 22:49:00 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第五十二天 | 图论part03。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十一天 | 图论part02]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141615379</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141615379</guid><author>qq_43456971</author><pubDate>Wed, 28 Aug 2024 14:06:16 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第五十一天 | 图论part02。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第五十天 | 图论part01]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141600269</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141600269</guid><author>qq_43456971</author><pubDate>Tue, 27 Aug 2024 14:14:28 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第五十天 | 图论part01。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四十九天 | 单调栈part02]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141422833</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141422833</guid><author>qq_43456971</author><pubDate>Thu, 22 Aug 2024 12:01:19 +0800</pubDate><description><![CDATA[利用单调栈寻找每一个元素右边比它大的元素，同时在单调栈中的下一个元素就是在它左边比它大的第一个元素，此时便形成了凹槽。每一个元素向左找到第一个比它小的元素，向右找到第一个比它小的元素。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四十八天 | 单调栈part01]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141402729</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141402729</guid><author>qq_43456971</author><pubDate>Wed, 21 Aug 2024 22:26:33 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第四十八天 | 单调栈part01。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四十六天 | 动态规划 part13]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141314620</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141314620</guid><author>qq_43456971</author><pubDate>Mon, 19 Aug 2024 10:36:34 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第四十六天 | 动态规划 part13。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四十五天 | 动态规划 part12]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141263957</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141263957</guid><author>qq_43456971</author><pubDate>Fri, 16 Aug 2024 18:47:30 +0800</pubDate><description><![CDATA[本题递推公式与初始化最为重要。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四十四天 | 动态规划 part11]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141223223</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141223223</guid><author>qq_43456971</author><pubDate>Thu, 15 Aug 2024 16:09:23 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第四十四天 | 动态规划 part11。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四十三天 | 动态规划 part10]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141193231</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141193231</guid><author>qq_43456971</author><pubDate>Wed, 14 Aug 2024 18:01:59 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第四十三天 | 动态规划 part10。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四十二天 | 动态规划 part09]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141156955</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141156955</guid><author>qq_43456971</author><pubDate>Tue, 13 Aug 2024 13:32:59 +0800</pubDate><description><![CDATA[【代码】代码随想录算法训练营第四十二天 | 动态规划 part09。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四十天 | 动态规划 part08]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141120451</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141120451</guid><author>qq_43456971</author><pubDate>Mon, 12 Aug 2024 13:28:49 +0800</pubDate><description><![CDATA[买卖股票和打家劫舍一样，都有两种状态，买还是不买，卖还是不卖，因此dp[i][0]表示第i天持有股票的最大现金，dp[i][1]表示第i天不持有股票的现金。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第三十九天 | 动态规划 part07]]></title><link>https://blog.youkuaiyun.com/qq_43456971/article/details/141103486</link><guid>https://blog.youkuaiyun.com/qq_43456971/article/details/141103486</guid><author>qq_43456971</author><pubDate>Sun, 11 Aug 2024 13:52:22 +0800</pubDate><description><![CDATA[这一题实际上就是多次调用上面的代码。考虑使用头节点不使用尾节点的情况和使用尾节点不使用头节点的情况。这是第一次遇见树形dp。思路是递归三部曲的思路，选择后序遍历。]]></description><category></category></item></channel></rss>