<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[starryHW的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/starryHW</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; starryHW]]></copyright><item><title><![CDATA[python基础]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/142713971</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/142713971</guid><author>starryHW</author><pubDate>Sat, 05 Oct 2024 15:26:24 +0800</pubDate><description><![CDATA[因为元组不可变，而列表是可变的，字典的key是不可变的。]]></description><category></category></item><item><title><![CDATA[239.滑动窗口最大值 347.前 K 个高频元素(队列)]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140716723</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140716723</guid><author>starryHW</author><pubDate>Fri, 26 Jul 2024 16:14:55 +0800</pubDate><description><![CDATA[failjava里面用 linkedlist 表示队列：boolean add(E)/boolean offer(E)	添加元素到队尾E remove()/E poll()	获取队首元素并从队列中删除E element()/E peek()	获取队首元素但并不从队列中删除。]]></description><category></category></item><item><title><![CDATA[1047. 删除字符串中的所有相邻重复项 150. 逆波兰表达式求值（栈）]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140695863</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140695863</guid><author>starryHW</author><pubDate>Thu, 25 Jul 2024 18:00:35 +0800</pubDate><description><![CDATA[accept。]]></description><category></category></item><item><title><![CDATA[151.翻转字符串里的单词 20. 有效的括号（栈）]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140695828</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140695828</guid><author>starryHW</author><pubDate>Thu, 25 Jul 2024 17:35:17 +0800</pubDate><description><![CDATA[fail。]]></description><category></category></item><item><title><![CDATA[344.反转字符串 27. 移除元素]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140618372</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140618372</guid><author>starryHW</author><pubDate>Mon, 22 Jul 2024 19:56:52 +0800</pubDate><description><![CDATA[accept。]]></description><category></category></item><item><title><![CDATA[383. 赎金信 第15题. 三数之和（哈希）--补7月19日]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140516758</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140516758</guid><author>starryHW</author><pubDate>Mon, 22 Jul 2024 10:16:59 +0800</pubDate><description><![CDATA[accept。]]></description><category></category></item><item><title><![CDATA[1. 两数之和 第454题.四数相加II （哈希表）]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140505249</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140505249</guid><author>starryHW</author><pubDate>Thu, 18 Jul 2024 10:24:07 +0800</pubDate><description><![CDATA[Accept可用map.containsKey()]]></description><category></category></item><item><title><![CDATA[349. 两个数组的交集 第202题. 快乐数 (哈希表)]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140499152</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140499152</guid><author>starryHW</author><pubDate>Wed, 17 Jul 2024 17:05:37 +0800</pubDate><description><![CDATA[Accept。]]></description><category></category></item><item><title><![CDATA[242.有效的字母异位词 1002. 查找常用字符 （哈希表）-补昨日]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140472662</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140472662</guid><author>starryHW</author><pubDate>Wed, 17 Jul 2024 14:27:48 +0800</pubDate><description><![CDATA[Accept题目为小写字母，自定义长度26的数组构成hash数组java遍历字符串：char c = str1.charAt(i);]]></description><category></category></item><item><title><![CDATA[206.反转链表 24. 两两交换链表中的节点]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140445130</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140445130</guid><author>starryHW</author><pubDate>Mon, 15 Jul 2024 17:48:04 +0800</pubDate><description><![CDATA[fail。]]></description><category></category></item><item><title><![CDATA[203.移除链表元素 707.设计链表 （链表）]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140384934</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140384934</guid><author>starryHW</author><pubDate>Fri, 12 Jul 2024 17:33:52 +0800</pubDate><description><![CDATA[fail有一点没想到。]]></description><category></category></item><item><title><![CDATA[977.有序数组的平方 209.长度最小的子数组 (数组)]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140360282</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140360282</guid><author>starryHW</author><pubDate>Thu, 11 Jul 2024 19:29:47 +0800</pubDate><description><![CDATA[fail其实想到双指针了，但是又想空间复杂度为O（1），发现实现不了，浪费了有效时间。]]></description><category></category></item><item><title><![CDATA[704.二分查找 27.移除元素]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140327518</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140327518</guid><author>starryHW</author><pubDate>Wed, 10 Jul 2024 16:31:26 +0800</pubDate><description><![CDATA[Accept注意 循环条件 left <= right。]]></description><category></category></item><item><title><![CDATA[利用事务读未提交解决未提交前kafka已消费数据问题]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/140322092</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/140322092</guid><author>starryHW</author><pubDate>Wed, 10 Jul 2024 14:21:29 +0800</pubDate><description><![CDATA[上面出现的问题是测试反应：有时会出现 key是存在的(来源于前端页面)，但是在kafka拿到key之后在数据库中查不到 直接返回不存在。]]></description><category></category></item><item><title><![CDATA[第五章 动态规划（二）]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/130456340</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/130456340</guid><author>starryHW</author><pubDate>Mon, 01 May 2023 18:20:17 +0800</pubDate><description><![CDATA[上面最后加上的s[j]-s[i-1]  是前缀和。]]></description><category></category></item><item><title><![CDATA[第五章 动态规划(一)]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/130254707</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/130254707</guid><author>starryHW</author><pubDate>Wed, 19 Apr 2023 23:18:36 +0800</pubDate><description><![CDATA[n件物品，物品可以用0次 或者 1次，且挑选的总体积小于等于背包容量，但是价值最大。不含i 表示不包含第i个物品的所有选择，含i 表示包含第个物品的所有选择。]]></description><category></category></item><item><title><![CDATA[搜索与图论(二)]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/130233034</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/130233034</guid><author>starryHW</author><pubDate>Tue, 18 Apr 2023 23:13:50 +0800</pubDate><description><![CDATA[bellman-ford应用于求不超过k条边的最短路问题。]]></description><category></category></item><item><title><![CDATA[第三章 搜索与图论(一)]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/130186625</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/130186625</guid><author>starryHW</author><pubDate>Sun, 16 Apr 2023 20:45:52 +0800</pubDate><description><![CDATA[与上题不同点在于减枝–去掉不满足条件的分支走法解法二：–比较原始的搜索顺序–效率比上面低一些。]]></description><category></category></item><item><title><![CDATA[数据结构(三)]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/130182297</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/130182297</guid><author>starryHW</author><pubDate>Sun, 16 Apr 2023 16:39:23 +0800</pubDate><description><![CDATA[前面的离散化可以看成是一种特殊的哈希方式。]]></description><category></category></item><item><title><![CDATA[数据结构(二)]]></title><link>https://blog.youkuaiyun.com/starryHW/article/details/130093238</link><guid>https://blog.youkuaiyun.com/starryHW/article/details/130093238</guid><author>starryHW</author><pubDate>Thu, 13 Apr 2023 00:10:15 +0800</pubDate><description><![CDATA[每个单词结尾处都要标记一下，因为这样才能知道检索出单词。]]></description><category></category></item></channel></rss>