<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[gogslow的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/gogslow</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; gogslow]]></copyright><item><title><![CDATA[6.s081 lab3]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/135202249</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/135202249</guid><author>gogslow</author><pubDate>Mon, 25 Dec 2023 16:06:32 +0800</pubDate><description><![CDATA[其中要注意的地方就是判断是否是最底层，如果是最底层，就不进行递归了。然后在相应地方定义并在exec.c中按要求添加代码即可。主要参考vm.c中的freewalk，第一个实验：打印页表。]]></description><category></category></item><item><title><![CDATA[二叉树遍历]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/131382262</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/131382262</guid><author>gogslow</author><pubDate>Tue, 27 Jun 2023 15:32:38 +0800</pubDate><description><![CDATA[具体就是每次循环先找到左子树中的最右节点，根据其右孩子为nullptr或者p，判断是否已经连接，如果是前序遍历，未连接时直接进行访问，并让p向左走，pre连接p，如果是中序遍历，已连接时（代表左边已经访问过）直接进行访问，并重置pre，p向右走。如果没访问过，当前节点入栈，向右边走。非递归算法看起来其实都差不多，都是利用栈，先找到最左边的节点，把路上的节点不断保存（放入栈内），到了叶子节点就出栈，然后往右边走一步。后序遍历因为是左、右、中的顺序，可以倒过来中、右、左，把前序遍历修改最后再翻转答案即可。]]></description><category></category></item><item><title><![CDATA[最近的学习]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/129163840</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/129163840</guid><author>gogslow</author><pubDate>Wed, 22 Feb 2023 16:20:12 +0800</pubDate><description><![CDATA[最近学习]]></description><category></category></item><item><title><![CDATA[76. 最小覆盖子串【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126508001</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126508001</guid><author>gogslow</author><pubDate>Wed, 24 Aug 2022 16:49:32 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[74. 搜索二维矩阵【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126504080</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126504080</guid><author>gogslow</author><pubDate>Wed, 24 Aug 2022 14:33:56 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[72. 编辑距离【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126503261</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126503261</guid><author>gogslow</author><pubDate>Wed, 24 Aug 2022 14:00:42 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[69. x 的平方根 【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126497808</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126497808</guid><author>gogslow</author><pubDate>Wed, 24 Aug 2022 09:22:51 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[67. 二进制求和【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126468985</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126468985</guid><author>gogslow</author><pubDate>Mon, 22 Aug 2022 16:42:03 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[65. 有效数字【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126467321</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126467321</guid><author>gogslow</author><pubDate>Mon, 22 Aug 2022 15:42:35 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[63. 不同路径 II 64. 最小路径和【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126428203</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126428203</guid><author>gogslow</author><pubDate>Fri, 19 Aug 2022 16:58:04 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[60. 排列序列【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126409220</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126409220</guid><author>gogslow</author><pubDate>Thu, 18 Aug 2022 17:02:22 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[56. 合并区间【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126381006</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126381006</guid><author>gogslow</author><pubDate>Wed, 17 Aug 2022 10:56:11 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[55. 跳跃游戏【leetcode】45. 跳跃游戏 II【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126369621</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126369621</guid><author>gogslow</author><pubDate>Tue, 16 Aug 2022 17:28:01 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[53. 最大子数组和【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126367301</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126367301</guid><author>gogslow</author><pubDate>Tue, 16 Aug 2022 15:32:38 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[51. N 皇后【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126360377</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126360377</guid><author>gogslow</author><pubDate>Tue, 16 Aug 2022 14:42:42 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[50. Pow(x, n)【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126348778</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126348778</guid><author>gogslow</author><pubDate>Mon, 15 Aug 2022 16:25:04 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[48. 旋转图像【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/126343655</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/126343655</guid><author>gogslow</author><pubDate>Mon, 15 Aug 2022 11:30:21 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[java 观察者模式]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/107903775</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/107903775</guid><author>gogslow</author><pubDate>Mon, 10 Aug 2020 05:53:01 +0800</pubDate><description><![CDATA[定义：

在对象之间定义了一对多的依赖，这样一来，当一个对象改变状态，依赖它的对象会收到通知并自动更新。

相当于微信订阅，你订阅了公众号，在它更新时就会自动给你发送消息。没有订阅它就不会给你发送消息。



图片转自https://blog.youkuaiyun.com/wanggang514260663/article/details/86138144



角色：

主要有四个角色：

抽象被观察者角色：也就是一个抽象主题，它把所有对观察者对象的引用保存在一个集合中，每个主题都可以有任意数量的观察者。抽象主题提.]]></description><category></category></item><item><title><![CDATA[简单工厂模式 C++]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/105186312</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/105186312</guid><author>gogslow</author><pubDate>Tue, 07 Apr 2020 22:49:31 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;

class Product
{
public:
    virtual void Show() = 0;
};

class ProductA: public Product
{
public:
    void Show()
    {
        cout &lt;&lt; "A" &lt;&...]]></description><category></category></item><item><title><![CDATA[42. 接雨水【leetcode】]]></title><link>https://blog.youkuaiyun.com/gogslow/article/details/105294496</link><guid>https://blog.youkuaiyun.com/gogslow/article/details/105294496</guid><author>gogslow</author><pubDate>Fri, 03 Apr 2020 16:00:38 +0800</pubDate><description><![CDATA[原题地址：https://leetcode-cn.com/problems/trapping-rain-water/

利用栈，栈保存位置。


class Solution {
public:
    int trap(vector&lt;int&gt;&amp; height) {
        int ret = 0, i = 0;
        stack&lt;int&gt; st;...]]></description><category></category></item></channel></rss>