<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lllllllDo的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lllllllDo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lllllllDo]]></copyright><item><title><![CDATA[代码随想录训练营Day24 回溯法介绍 77. 组合]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136793332</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136793332</guid><author>lllllllDo</author><pubDate>Sun, 17 Mar 2024 23:43:29 +0800</pubDate><description><![CDATA[回溯法是为了解决k层for循环嵌套的问题，本质上是暴力解法但是可以用进行优化。]]></description><category></category></item><item><title><![CDATA[代码随想录训练营Day13 239. 滑动窗口最大值 347.前 K 个高频元素]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136448989</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136448989</guid><author>lllllllDo</author><pubDate>Tue, 05 Mar 2024 23:42:35 +0800</pubDate><description><![CDATA[【代码】代码随想录训练营Day13 239. 滑动窗口最大值 347.前 K 个高频元素。]]></description><category></category></item><item><title><![CDATA[代码随想录训练营Day11 20. 有效的括号 1047. 删除字符串中的所有相邻重复项 150. 逆波兰表达式求值]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136441163</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136441163</guid><author>lllllllDo</author><pubDate>Mon, 04 Mar 2024 00:43:21 +0800</pubDate><description><![CDATA[【代码】代码随想录训练营Day11 20. 有效的括号 1047. 删除字符串中的所有相邻重复项 150. 逆波兰表达式求值。]]></description><category></category></item><item><title><![CDATA[代码随想录训练营Day8 344. 反转字符串 541. 反转字符串II 54.替换数字 151.翻转字符串里的单词]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136365038</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136365038</guid><author>lllllllDo</author><pubDate>Sun, 03 Mar 2024 21:20:14 +0800</pubDate><description><![CDATA[注意返回时从list转成str的方法是用join。]]></description><category></category></item><item><title><![CDATA[代码随想录训练营Day10 栈与队列 232.用栈实现队列 225. 用队列实现栈]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136420028</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136420028</guid><author>lllllllDo</author><pubDate>Sat, 02 Mar 2024 20:08:49 +0800</pubDate><description><![CDATA[stack = []stack[-1]或者采用实现具有链表性能特征的栈。]]></description><category></category></item><item><title><![CDATA[代码随想录Day7 1. 两数之和 454.四数相加II 383. 赎金信 15. 三数之和 18. 四数之和]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136314644</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136314644</guid><author>lllllllDo</author><pubDate>Tue, 27 Feb 2024 23:50:24 +0800</pubDate><description><![CDATA[时间复杂度：O(n)空间复杂度：O(n)]]></description><category></category></item><item><title><![CDATA[代码随想录训练营Day6 242.有效的字母异位词 349. 两个数组的交集 202. 快乐数 集合/字典/列表]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136311496</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136311496</guid><author>lllllllDo</author><pubDate>Tue, 27 Feb 2024 00:45:11 +0800</pubDate><description><![CDATA[集合可以看作是没有值的字典，其元素不重复，通过将list或其他类型的数据转换成集合可以过滤掉重复元素。sorted函数有返回值。]]></description><category></category></item><item><title><![CDATA[代码随想录训练营day3 203.移除链表元素 707.设计链表 206.反转链表]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136259570</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136259570</guid><author>lllllllDo</author><pubDate>Fri, 23 Feb 2024 23:54:33 +0800</pubDate><description><![CDATA[时间复杂度：O(n)空间复杂度：O(1)时间复杂度：O(n)空间复杂度：O(n)]]></description><category></category></item><item><title><![CDATA[代码随想录训练营day2 977.有序数组的平方 209. 长度最小的子数组 59. 螺旋矩阵 II]]></title><link>https://blog.youkuaiyun.com/lllllllDo/article/details/136229534</link><guid>https://blog.youkuaiyun.com/lllllllDo/article/details/136229534</guid><author>lllllllDo</author><pubDate>Thu, 22 Feb 2024 23:40:00 +0800</pubDate><description><![CDATA[思路：双指针从两头往里遍历，存储平方值大的到新数组res中时间复杂度：O(n)]]></description><category></category></item></channel></rss>