<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hht12138的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hht12138</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hht12138]]></copyright><item><title><![CDATA[解决Failed to connect to github.com port 443:connection timed out的问题]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/133393078</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/133393078</guid><author>hht12138</author><pubDate>Thu, 28 Sep 2023 21:12:43 +0800</pubDate><description><![CDATA[查看你的代理 http.proxy 这一项，修改成你自己用的代理端口号即可。使用指令修改git通过的端口号，我用的代理是7890。因为用了梯子，导致端口号发生变化。]]></description><category></category></item><item><title><![CDATA[代码随想录day16]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130259500</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130259500</guid><author>hht12138</author><pubDate>Tue, 25 Apr 2023 21:32:09 +0800</pubDate><description><![CDATA[递归法的遍历应用，bfs也行。]]></description><category></category></item><item><title><![CDATA[代码随想录day15]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130245960</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130245960</guid><author>hht12138</author><pubDate>Wed, 19 Apr 2023 16:02:47 +0800</pubDate><description><![CDATA[层序遍历需要用到队列。]]></description><category></category></item><item><title><![CDATA[代码随想录day13]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130207083</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130207083</guid><author>hht12138</author><pubDate>Mon, 17 Apr 2023 20:21:54 +0800</pubDate><description><![CDATA[主要思路：用队列维护滑动窗口，使队列内的值是递减序列，这样出口处的值就是最大值关键点在注释的两个地方。]]></description><category></category></item><item><title><![CDATA[代码随想录day11]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130175936</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130175936</guid><author>hht12138</author><pubDate>Sat, 15 Apr 2023 21:55:31 +0800</pubDate><description><![CDATA[思路就是，当遍历到一个左括号的时候，栈中压入一个右括号遍历到右括号时，栈弹出，]]></description><category></category></item><item><title><![CDATA[代码随想录day9]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130116170</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130116170</guid><author>hht12138</author><pubDate>Wed, 12 Apr 2023 20:45:08 +0800</pubDate><description><![CDATA[KMP算法绞尽脑汁对于next回退的部分仍有疑问，等学完动态规划再来看看。]]></description><category></category></item><item><title><![CDATA[代码随想录day8]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130110813</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130110813</guid><author>hht12138</author><pubDate>Wed, 12 Apr 2023 16:46:56 +0800</pubDate><description><![CDATA[目的在于不调用函数库，实现反转函数。]]></description><category></category></item><item><title><![CDATA[代码随想录day7]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130058021</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130058021</guid><author>hht12138</author><pubDate>Mon, 10 Apr 2023 13:57:31 +0800</pubDate><description><![CDATA[对于四个数组，从对称性上来看，应该两两处理，用两个for循环与两数之和同理，这里只需让前两个数组之和，与后两个数组之和为相反数即可需要用map记录前两个数组和的结果，与后两个数组的和去配对注意这里配对成功之后不是count++，而是count+=前两个和出现的次数因为。]]></description><category></category></item><item><title><![CDATA[代码随想录day6]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130042412</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130042412</guid><author>hht12138</author><pubDate>Sun, 09 Apr 2023 15:13:13 +0800</pubDate><description><![CDATA[一开始想着构建两个hash表，但如果后面字符串长的可能会超时这里借用数组构建hash表，主要思想是26个字母组成的数组统计出现次数。]]></description><category></category></item><item><title><![CDATA[代码随想录day4]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130033386</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130033386</guid><author>hht12138</author><pubDate>Sat, 08 Apr 2023 19:58:11 +0800</pubDate><description><![CDATA[出现问题就是使用slow->next = slow->next->next;并且使用虚拟头结点，会方便很多，要不然每次针对头结点（没有前一个指针指向头结点），还要单独处理。所以修改slow的next，无法影响dummyHead的next，也就无法删除节点了。实际上之前的定义方式，并没有起到指针的效果，而是相当于给链表添加了三个虚拟头结点。用编译器查看内存可知，cur, slow, dummyHead是三块不同的内存。这里遇到了指针指向的问题，一开始定义快慢指针为。之后定义快慢指针为，问题解决。]]></description><category></category></item><item><title><![CDATA[代码随想录day3]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130021554</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130021554</guid><author>hht12138</author><pubDate>Fri, 07 Apr 2023 22:07:20 +0800</pubDate><description><![CDATA[这里应用到三个节点，即前->中->后，遍历中节点即可，后节点可由中节点得到。以防指向调节后找不到下一个节点。链表比较熟悉了，这里仅当复习。]]></description><category></category></item><item><title><![CDATA[代码随想录day2]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/130021224</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/130021224</guid><author>hht12138</author><pubDate>Fri, 07 Apr 2023 21:59:53 +0800</pubDate><description><![CDATA[数组其实是有序的， 只不过考虑到负数平方之后可能成为最大数。那么数组平方的最大值就在数组的两端，。此时可以考虑双指针法了，i指向起始位置，j指向终止位置，左右比较谁大再塞到数组中。定义一个新数组result，考虑到，于是让k指向result数组终止位置。]]></description><category></category></item><item><title><![CDATA[代码随想录day1]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/129975398</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/129975398</guid><author>hht12138</author><pubDate>Wed, 05 Apr 2023 19:37:39 +0800</pubDate><description><![CDATA[常见的两种，左闭右闭即[left, right]，或者左闭右开即[left, right)。我查找完一次middle并发现不符合条件，下一次查询时，这个middle应当踢出区间。]]></description><category></category></item><item><title><![CDATA[lio-sam运行思路整理——图解预积分]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/126473635</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/126473635</guid><author>hht12138</author><pubDate>Mon, 22 Aug 2022 20:59:13 +0800</pubDate><description><![CDATA[这里是个人对于lio-sam运行流程的一些理解，如有不对之处，欢迎批评指正，共同进步]]></description><category></category></item><item><title><![CDATA[lio-sam运行思路整理——预积分模块odometryHandler()]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/126473588</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/126473588</guid><author>hht12138</author><pubDate>Mon, 22 Aug 2022 20:57:08 +0800</pubDate><description><![CDATA[这里是个人对于lio-sam运行流程的一些理解，如有不对之处，欢迎批评指正，共同进步]]></description><category></category></item><item><title><![CDATA[lio-sam运行思路整理——预积分模块imuHandler()]]></title><link>https://blog.youkuaiyun.com/hht12138/article/details/126473480</link><guid>https://blog.youkuaiyun.com/hht12138/article/details/126473480</guid><author>hht12138</author><pubDate>Mon, 22 Aug 2022 20:52:37 +0800</pubDate><description><![CDATA[这里是个人对于lio-sam运行流程的一些理解，如有不对之处，欢迎批评指正，共同进步]]></description><category></category></item></channel></rss>