<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Go_Zezhou的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Go_Zezhou</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Go_Zezhou]]></copyright><item><title><![CDATA[pnpm下载后无法识别的问题及解决方法]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/158181201</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/158181201</guid><author>Go_Zezhou</author><pubDate>Wed, 18 Feb 2026 21:41:36 +0800</pubDate><description><![CDATA[安装nvm后使用pnpm失败]]></description><category></category></item><item><title><![CDATA[render网站保存历史记录错误解决]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/158068079</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/158068079</guid><author>Go_Zezhou</author><pubDate>Sat, 14 Feb 2026 10:54:46 +0800</pubDate><description><![CDATA[render网站保存历史记录错误解决]]></description><category></category></item><item><title><![CDATA[render快速部署网站和常见问题解决]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/157507842</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/157507842</guid><author>Go_Zezhou</author><pubDate>Sat, 31 Jan 2026 20:56:46 +0800</pubDate><description><![CDATA[render快速上线网站]]></description><category></category></item><item><title><![CDATA[git提交代码详细步骤【首次/多次提交】]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/157506063</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/157506063</guid><author>Go_Zezhou</author><pubDate>Thu, 29 Jan 2026 11:48:33 +0800</pubDate><description><![CDATA[git提交代码新手指南]]></description><category></category></item><item><title><![CDATA[在线性代数里聊聊word embedding]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/151071227</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/151071227</guid><author>Go_Zezhou</author><pubDate>Wed, 03 Sep 2025 15:48:40 +0800</pubDate><description><![CDATA[word embedding的前世今生和线性代数的爱情故事]]></description><category></category></item><item><title><![CDATA[解决hexo deploy报错：fatal: bad config line 1 in file .git/config]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/150412075</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/150412075</guid><author>Go_Zezhou</author><pubDate>Fri, 15 Aug 2025 08:41:10 +0800</pubDate><description><![CDATA[hexo deploy报错]]></description><category></category></item><item><title><![CDATA[最新最全！github+hexo：搭建个人博客的常见错误及解决！]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/149689269</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/149689269</guid><author>Go_Zezhou</author><pubDate>Mon, 11 Aug 2025 10:17:22 +0800</pubDate><description><![CDATA[一个历时14天的blog搭建记（我的第一个网站）]]></description><category></category></item><item><title><![CDATA[leetcode75【经典动态规划】之：最长公共子序列]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/149484350</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/149484350</guid><author>Go_Zezhou</author><pubDate>Sun, 20 Jul 2025 19:15:31 +0800</pubDate><description><![CDATA[经典动态规划两题分析]]></description><category></category></item><item><title><![CDATA[leetcode 75: bfs经典题之腐烂的橘子]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/149168140</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/149168140</guid><author>Go_Zezhou</author><pubDate>Mon, 07 Jul 2025 13:18:49 +0800</pubDate><description><![CDATA[dfs经典两题]]></description><category></category></item><item><title><![CDATA[从lower_bound的名字由来开始理解记忆]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148973654</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148973654</guid><author>Go_Zezhou</author><pubDate>Sat, 28 Jun 2025 11:13:44 +0800</pubDate><description><![CDATA[二次理解记忆lower_bound]]></description><category></category></item><item><title><![CDATA[leetcode hot 100之：二叉树的最近公共祖先]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148875257</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148875257</guid><author>Go_Zezhou</author><pubDate>Tue, 24 Jun 2025 18:11:37 +0800</pubDate><description><![CDATA[本来不打算写的哈哈哈但是发现这一道递归我是有思路的！自己能想到一些方向！看了题解发现，我想的3种情况中，2和3可以合并，也就是往上找的情况。看这个题解是否能明白呢？，所以方便地递归判断其左右子树，因此解题方法需要立足于从上往下，这和我的思路的不同的。真的可以存储父节点欸！和官方题解的不太一样哈哈哈，我个人比较习惯这种写法。1、祖先一定是自身或往上找，所以如何逆着走呢？]]></description><category></category></item><item><title><![CDATA[leetcode hot 100之：二叉树的层序遍历]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148809846</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148809846</guid><author>Go_Zezhou</author><pubDate>Sat, 21 Jun 2025 14:14:10 +0800</pubDate><description><![CDATA[树的层序遍历（bfs）]]></description><category></category></item><item><title><![CDATA[lc hot 100之：子集]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148510630</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148510630</guid><author>Go_Zezhou</author><pubDate>Sun, 08 Jun 2025 11:46:38 +0800</pubDate><description><![CDATA[dfs题目对比和两种思路]]></description><category></category></item><item><title><![CDATA[lc hot 100之：dummy哨兵节点创建方法]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148423920</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148423920</guid><author>Go_Zezhou</author><pubDate>Wed, 04 Jun 2025 11:58:52 +0800</pubDate><description><![CDATA[总结dummy哨兵节点的创建方法]]></description><category></category></item><item><title><![CDATA[lc hot 100之：双指针题目对比]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148364951</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148364951</guid><author>Go_Zezhou</author><pubDate>Sun, 01 Jun 2025 12:24:13 +0800</pubDate><description><![CDATA[如果是左边的指针右移，如果是右边的指针左移。可以证明如果要使area>原值，那么一定是移动height值最小的那个位置，不然怎么移都只会变小或不变。我们可以想象，有一个指针一定会从头往后遍历字符串，那么怎么判断他之前有多少个最大无重复字符呢？OK写到这里自己有一些感觉了，双指针题目一般的难点就是怎么移动指针。希望在做题的时候能想明白这个，代码应该不难写。那么为了距离最远，我们直接让两个指针指向0, n-1，一头一尾。写到两个给我感觉很类似的双指针题目，但是代码不同，我想把两个题放在一起，对比着看看。]]></description><category></category></item><item><title><![CDATA[lc hot 100之：两数相加]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148281360</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148281360</guid><author>Go_Zezhou</author><pubDate>Wed, 28 May 2025 12:13:17 +0800</pubDate><description><![CDATA[链表的两数相加，链表代码细节]]></description><category></category></item><item><title><![CDATA[lc hot 100之：找到所有数组中消失的数字]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148234029</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148234029</guid><author>Go_Zezhou</author><pubDate>Mon, 26 May 2025 18:13:49 +0800</pubDate><description><![CDATA[一表两用的巧妙方法]]></description><category></category></item><item><title><![CDATA[lc hot 100之：回文链表]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148202875</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148202875</guid><author>Go_Zezhou</author><pubDate>Sun, 25 May 2025 12:14:28 +0800</pubDate><description><![CDATA[链表经典题：反转和找中点]]></description><category></category></item><item><title><![CDATA[lc hot 100之：多数元素]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148201993</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148201993</guid><author>Go_Zezhou</author><pubDate>Sun, 25 May 2025 10:55:27 +0800</pubDate><description><![CDATA[摩尔投票法]]></description><category></category></item><item><title><![CDATA[lc hot 100之：环形链表]]></title><link>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148189489</link><guid>https://blog.youkuaiyun.com/Go_Zezhou/article/details/148189489</guid><author>Go_Zezhou</author><pubDate>Sat, 24 May 2025 12:40:03 +0800</pubDate><description><![CDATA[链表的重要思想——快慢指针]]></description><category></category></item></channel></rss>