<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Lindge111的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Lindge111</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Lindge111]]></copyright><item><title><![CDATA[Pixel 2 is already running. If that is not the case, delete \.android\avd\Pixel_2.avd\*.lock and try]]></title><link>https://blog.youkuaiyun.com/Lindge111/article/details/146447834</link><guid>https://blog.youkuaiyun.com/Lindge111/article/details/146447834</guid><author>Lindge111</author><pubDate>Sat, 22 Mar 2025 22:26:58 +0800</pubDate><description><![CDATA[解决虚拟设备正在运行，删除*.lock时无法删除的问题]]></description><category></category></item><item><title><![CDATA[DFS求连通块]]></title><link>https://blog.youkuaiyun.com/Lindge111/article/details/99310275</link><guid>https://blog.youkuaiyun.com/Lindge111/article/details/99310275</guid><author>Lindge111</author><pubDate>Mon, 12 Aug 2019 16:34:39 +0800</pubDate><description><![CDATA[DFS求连通块

DFS又称深度优先搜索，下面是一道用DFS求连通块的例题：
输入一个m行n列的字符矩阵，统计字符“@”组成多少个八连块。如果两个字符“@”所在的格子相邻（横，竖或者对角线方向），就说他们属于同一个八连块。例如，图：
                                   ****@
      ...]]></description><category></category></item></channel></rss>