<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wei375的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wei375</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wei375]]></copyright><item><title><![CDATA[DAY62Floyd算法]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/142316847</link><guid>https://blog.youkuaiyun.com/wei375/article/details/142316847</guid><author>wei375</author><pubDate>Tue, 17 Sep 2024 18:00:09 +0800</pubDate><description><![CDATA[即多个起点到多个终点的多条最短路径。其对权值正负没有要求，都可以处理。]]></description><category></category></item><item><title><![CDATA[DAY60Bellman_ford 算法]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/142286631</link><guid>https://blog.youkuaiyun.com/wei375/article/details/142286631</guid><author>wei375</author><pubDate>Sun, 15 Sep 2024 22:51:27 +0800</pubDate><description><![CDATA[共有 n 个编号为 1 到 n 的城市，通过道路网络连接，网络中的道路仅允许从某个城市单向通行到另一个城市，不能反向通行。负权回路是指一系列道路的总权值为负，这样的回路使得通过反复经过回路中的道路，理论上可以无限地减少总成本或无限地增加总收益。请找出从城市 1 到城市 n 的所有可能路径中，综合政府补贴后的最低运输成本。网络中的道路都有各自的运输成本和政府补贴，道路的权值计算方式为：运输成本 - 政府补贴。请找出从城市 1 到城市 n 的所有可能路径中，综合政府补贴后的最低运输成本。]]></description><category></category></item><item><title><![CDATA[自定义字符串排序]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/142260187</link><guid>https://blog.youkuaiyun.com/wei375/article/details/142260187</guid><author>wei375</author><pubDate>Sat, 14 Sep 2024 15:43:43 +0800</pubDate><description><![CDATA[【代码】自定义字符串排序。]]></description><category></category></item><item><title><![CDATA[DAY59最短路径]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/142229384</link><guid>https://blog.youkuaiyun.com/wei375/article/details/142229384</guid><author>wei375</author><pubDate>Fri, 13 Sep 2024 22:13:16 +0800</pubDate><description><![CDATA[对所有边进行松弛n-1次操作（n为节点数量），从而求得目标最短路。当权值存在负数时就不能用dijkstra了。]]></description><category></category></item><item><title><![CDATA[DAY58拓扑排序]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/142220181</link><guid>https://blog.youkuaiyun.com/wei375/article/details/142220181</guid><author>wei375</author><pubDate>Fri, 13 Sep 2024 21:38:33 +0800</pubDate><description><![CDATA[记得添加边的话利用List<List>，对每个点都建立一个列表，里面存放它所指向的点。]]></description><category></category></item><item><title><![CDATA[DAY57最小生成树]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/142152918</link><guid>https://blog.youkuaiyun.com/wei375/article/details/142152918</guid><author>wei375</author><pubDate>Wed, 11 Sep 2024 23:23:52 +0800</pubDate><description><![CDATA[利用并查集判断边的两个节点是否在同一集合。]]></description><category></category></item><item><title><![CDATA[DAY56]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/142093259</link><guid>https://blog.youkuaiyun.com/wei375/article/details/142093259</guid><author>wei375</author><pubDate>Tue, 10 Sep 2024 22:08:54 +0800</pubDate><description><![CDATA[【代码】DAY56。]]></description><category></category></item><item><title><![CDATA[DAY55并查集]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/142059195</link><guid>https://blog.youkuaiyun.com/wei375/article/details/142059195</guid><author>wei375</author><pubDate>Mon, 09 Sep 2024 15:21:02 +0800</pubDate><description><![CDATA[3）判断两个节点是否在同一个集合isSame(int u,int v)2）将两个节点接入到到同一个集合join(int u,int v)因为这个是无向图，所以可以直接套用并查集模板。1）寻找根节点find(int u)并查集常用来解决连通性问题。]]></description><category></category></item><item><title><![CDATA[DAY53]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141999958</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141999958</guid><author>wei375</author><pubDate>Sun, 08 Sep 2024 00:43:09 +0800</pubDate><description><![CDATA[因此可以计算每个区域四周的情况来算周长。注意只有一个岛屿且岛屿中间没有水域。]]></description><category></category></item><item><title><![CDATA[DAY52]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141971538</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141971538</guid><author>wei375</author><pubDate>Fri, 06 Sep 2024 22:44:44 +0800</pubDate><description><![CDATA[【代码】DAY52。]]></description><category></category></item><item><title><![CDATA[DAY51]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141940113</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141940113</guid><author>wei375</author><pubDate>Thu, 05 Sep 2024 21:03:18 +0800</pubDate><description><![CDATA[【代码】DAY51。]]></description><category></category></item><item><title><![CDATA[DAY50]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141888161</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141888161</guid><author>wei375</author><pubDate>Wed, 04 Sep 2024 11:08:35 +0800</pubDate><description><![CDATA[【代码】DAY50。]]></description><category></category></item><item><title><![CDATA[DAY49单调栈II]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141856499</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141856499</guid><author>wei375</author><pubDate>Tue, 03 Sep 2024 11:59:00 +0800</pubDate><description><![CDATA[【代码】DAY49单调栈II。]]></description><category></category></item><item><title><![CDATA[DAY48单调栈01]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141817651</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141817651</guid><author>wei375</author><pubDate>Mon, 02 Sep 2024 18:05:30 +0800</pubDate><description><![CDATA[当我们把Deque作为Stack使用时，注意只调用push()/pop()/peek()方法，不要调用addFirst()/removeFirst()/peekFirst()方法，那样会破坏栈的本质。双端队列：Deque是一个接口，它的实现类有ArrayDeque和LinkedList。]]></description><category></category></item><item><title><![CDATA[DAY46]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141788181</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141788181</guid><author>wei375</author><pubDate>Sun, 01 Sep 2024 19:23:50 +0800</pubDate><description><![CDATA[若第i个字符等于第j个字符，则只需要知道dp[i+1][j-1]是否是回文的，dp[i][j]含义：位置i到位置j的这段子串是否是回文.那么这个遍历，i是递减遍历，j是递增遍历。]]></description><category></category></item><item><title><![CDATA[DAY45]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141729847</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141729847</guid><author>wei375</author><pubDate>Fri, 30 Aug 2024 23:52:42 +0800</pubDate><description><![CDATA[【代码】DAY45。]]></description><category></category></item><item><title><![CDATA[DAY44]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141674378</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141674378</guid><author>wei375</author><pubDate>Thu, 29 Aug 2024 13:11:22 +0800</pubDate><description><![CDATA[#最长公共子序列。]]></description><category></category></item><item><title><![CDATA[DAY43]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141615373</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141615373</guid><author>wei375</author><pubDate>Wed, 28 Aug 2024 00:20:31 +0800</pubDate><description><![CDATA[【代码】DAY43。]]></description><category></category></item><item><title><![CDATA[DAY42股票问题II]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141614735</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141614735</guid><author>wei375</author><pubDate>Tue, 27 Aug 2024 23:45:33 +0800</pubDate><description><![CDATA[【代码】DAY42股票问题II。]]></description><category></category></item><item><title><![CDATA[DAY41 股票问题]]></title><link>https://blog.youkuaiyun.com/wei375/article/details/141572931</link><guid>https://blog.youkuaiyun.com/wei375/article/details/141572931</guid><author>wei375</author><pubDate>Mon, 26 Aug 2024 20:48:09 +0800</pubDate><description><![CDATA[最多同时持有一只股票。]]></description><category></category></item></channel></rss>