<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sRiddle的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sRiddle</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sRiddle]]></copyright><item><title><![CDATA[牛客每日一题 | 最大子矩阵]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136661162</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136661162</guid><author>sRiddle</author><pubDate>Tue, 12 Mar 2024 19:50:10 +0800</pubDate><description><![CDATA[题目说明了列数最大为2，首先考虑只有1列的情况dp[n][k]表示前n个数的最大k个子数组和，那么使用sum表示前缀和就有dp[i][k] = dp[j][k-1]+sum[i]-sum[j];那么考虑这道题，可以理解为从第一列选择i行，从第二列选择j行，使得子数组个数和为k，且和最大，对于每一列都可以使用1列的dp来求解，sum此时就是一个二维数组，第二个元素表示哪一列。特别的，当i=j时那么需要考虑两列合并的和比单独一列大的情况。]]></description><category></category></item><item><title><![CDATA[力扣每日一题：Dijkstra1976.到达目的地的方案数]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136475010</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136475010</guid><author>sRiddle</author><pubDate>Tue, 05 Mar 2024 12:31:50 +0800</pubDate><description><![CDATA[考虑一个点u，原点到u的最短路径为dis[u]，最短路径数目为ways[u]，那么对于u的连通点v，又u到v的权值k，然后原点到v的最短路径是dis[v]，最短路径数目为ways[v]。本题是在非负权值图中求解最短路径，典型的Dijkstra算法的应用，只不过在求解最短路径时，还需要记录最短路径数目。这个又涉及到一点动态规划的思想。那么从u到v，有如下递推公式。]]></description><category></category></item><item><title><![CDATA[代码随想录Day67 | 695.岛屿的最大面积 1020.飞地的数量]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136426768</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136426768</guid><author>sRiddle</author><pubDate>Sun, 03 Mar 2024 11:34:30 +0800</pubDate><description><![CDATA[采用bfs，这道题相较于之前的题变为了求岛屿的最大面积。那就说明我们每遇到一个新的岛屿就要重新计算一个面积，然后和之前的最大面积比较。将边缘陆地形成的岛屿全部变为海洋后，再重新遍历整个图，得到的就是飞地。]]></description><category></category></item><item><title><![CDATA[代码随想录Day66 | 图的DFS与BFS]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136410226</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136410226</guid><author>sRiddle</author><pubDate>Sat, 02 Mar 2024 10:18:06 +0800</pubDate><description><![CDATA[无向图在dfs的时候需要考虑后续节点的连通会与父节点连接，所以，dfs参数中需要加上一个父节点。从出发点一圈一圈的搜索，需要使用数据结构来存储遍历的数据，可以是有队列或者栈。终止条件为当当前搜索点的下标为n-1时。本题可以很好的练习了解BFS。本质上就是回溯算法。dfs搜索路径即可。]]></description><category></category></item><item><title><![CDATA[力扣2月最后三天的每日一题]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136369489</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136369489</guid><author>sRiddle</author><pubDate>Thu, 29 Feb 2024 14:54:06 +0800</pubDate><description><![CDATA[不会做，全靠灵神的视频讲解2867.统计树中的合法路径数目。]]></description><category></category></item><item><title><![CDATA[代码随想录Day 65| 总结]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136368704</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136368704</guid><author>sRiddle</author><pubDate>Thu, 29 Feb 2024 13:40:41 +0800</pubDate><description><![CDATA[Day65]]></description><category></category></item><item><title><![CDATA[代码随想录Day64 | 84.柱状图中最大的矩形]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136342771</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136342771</guid><author>sRiddle</author><pubDate>Wed, 28 Feb 2024 12:21:50 +0800</pubDate><description><![CDATA[Day64]]></description><category></category></item><item><title><![CDATA[代码随想录Day63 |503.下一个更大元素II 42. 接雨水]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136312859</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136312859</guid><author>sRiddle</author><pubDate>Tue, 27 Feb 2024 11:56:33 +0800</pubDate><description><![CDATA[对于栈内一个可以积水的情况，栈头元素表示当前木板，栈头第二个元素应当表示当前木板的左边最大值，待入栈元素表示当前木板的右边木板。当右端木板最大值比左端木板最大值大时，我们考虑左指针指向的当前木板。那么其一定是可以存水的，因为其右边有比他高的木板。对于一个下标i寻找其左边的第一个大值和右边第一个大值，这个位置的积水量就可以求得。两个指针分别从头和尾向中间移动，并记录扫描过的左端和右端木板最大值。当遇到与栈头相同的元素要入栈时，应当弹出栈头，压入最新的下标。栈中存放的元素：当前木板的下标。]]></description><category></category></item><item><title><![CDATA[代码随想录Day62 | 739.每日温度 496.下一个更大元素 I]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136291156</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136291156</guid><author>sRiddle</author><pubDate>Mon, 26 Feb 2024 13:20:06 +0800</pubDate><description><![CDATA[Day62]]></description><category></category></item><item><title><![CDATA[代码随想录Day60 | 647. 回文子串 516.最长回文子序列]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136267448</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136267448</guid><author>sRiddle</author><pubDate>Sat, 24 Feb 2024 10:19:45 +0800</pubDate><description><![CDATA[Day60]]></description><category></category></item><item><title><![CDATA[代码随想录Day59 | 583. 两个字符串的删除操作 72. 编辑距离]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136247230</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136247230</guid><author>sRiddle</author><pubDate>Fri, 23 Feb 2024 09:21:09 +0800</pubDate><description><![CDATA[Day59]]></description><category></category></item><item><title><![CDATA[代码随想录Day58 | 392.判断子序列 115.不同的子序列]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136224263</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136224263</guid><author>sRiddle</author><pubDate>Thu, 22 Feb 2024 09:47:52 +0800</pubDate><description><![CDATA[Day58]]></description><category></category></item><item><title><![CDATA[代码随想录Day57 |1143.最长公共子序列 1035.不相交的线 53. 最大子序和]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136202358</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136202358</guid><author>sRiddle</author><pubDate>Wed, 21 Feb 2024 10:33:25 +0800</pubDate><description><![CDATA[Day57]]></description><category></category></item><item><title><![CDATA[代码随想录Day56 | 300.最长递增子序列 674. 最长连续递增序列 718. 最长重复子数组]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136182677</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136182677</guid><author>sRiddle</author><pubDate>Tue, 20 Feb 2024 12:32:04 +0800</pubDate><description><![CDATA[Day56]]></description><category></category></item><item><title><![CDATA[代码随想录Day55 | 股票买卖]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136162523</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136162523</guid><author>sRiddle</author><pubDate>Mon, 19 Feb 2024 09:56:39 +0800</pubDate><description><![CDATA[Day55]]></description><category></category></item><item><title><![CDATA[代码随想录Day54 | 股票买卖]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136145178</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136145178</guid><author>sRiddle</author><pubDate>Sun, 18 Feb 2024 09:59:44 +0800</pubDate><description><![CDATA[Day53]]></description><category></category></item><item><title><![CDATA[代码随想录Day53 | 股票买卖]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136135103</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136135103</guid><author>sRiddle</author><pubDate>Sat, 17 Feb 2024 14:47:49 +0800</pubDate><description><![CDATA[首先对于dp[j][0]，由于只会购买一次，所以如果前一天持有股票那么dp[j][0] = dp[j-1][0]。其次对于dp[j][1]，如果第j-1天不持有股票那么dp[j][1] = dp[j-1][1]。如果第j天卖出股票那么dp[j][1] = dp[j-1][0]+prices[j]其次对于dp[j][1]，如果第j-1天不持有股票那么dp[j][1] = dp[j-1][1]。首先对于dp[j][0]，由于只会购买一次，所以如果前一天持有股票那么dp[j][0] = dp[j-1][0]。]]></description><category></category></item><item><title><![CDATA[代码随想录Day52 | 打家劫舍]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136126067</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136126067</guid><author>sRiddle</author><pubDate>Fri, 16 Feb 2024 21:30:54 +0800</pubDate><description><![CDATA[Day52]]></description><category></category></item><item><title><![CDATA[代码随想录Day51 | 139.单词拆分 多重背包]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136118313</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136118313</guid><author>sRiddle</author><pubDate>Fri, 16 Feb 2024 09:34:36 +0800</pubDate><description><![CDATA[具体解决方法就是利用01背包，然后对每个物品在判断是否选择的时候，改为选取多少个。本质上就是01背包，只不过对于每种物品的个数大于等于1，但不是无限的。]]></description><category></category></item><item><title><![CDATA[代码随想录Day50 | 70. 爬楼梯 322. 零钱兑换 279.完全平方数]]></title><link>https://blog.youkuaiyun.com/sRiddle/article/details/136116205</link><guid>https://blog.youkuaiyun.com/sRiddle/article/details/136116205</guid><author>sRiddle</author><pubDate>Wed, 14 Feb 2024 22:16:53 +0800</pubDate><description><![CDATA[Day50]]></description><category></category></item></channel></rss>