<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[2201_75460768的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/2201_75460768</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; 2201_75460768]]></copyright><item><title><![CDATA[python实现dfs全套系列（思路+模版+优化+典型例题）]]></title><link>https://blog.youkuaiyun.com/2201_75460768/article/details/136853481</link><guid>https://blog.youkuaiyun.com/2201_75460768/article/details/136853481</guid><author>2201_75460768</author><pubDate>Wed, 20 Mar 2024 21:37:09 +0800</pubDate><description><![CDATA[助你轻松get用python实现dfs]]></description><category></category></item><item><title><![CDATA[dfs解决蓝桥杯全球气候变暖问题]]></title><link>https://blog.youkuaiyun.com/2201_75460768/article/details/136635578</link><guid>https://blog.youkuaiyun.com/2201_75460768/article/details/136635578</guid><author>2201_75460768</author><pubDate>Mon, 11 Mar 2024 21:28:37 +0800</pubDate><description><![CDATA[算法通过深度优先搜索（DFS）遍历二维网格，寻找并计数未被访问过的高地孤岛。对于每个高地位置，如果未被访问，则启动DFS，标记访问状态并检查是否为中心点。DFS递归地搜索相邻高地，直到所有连通高地被访问。最终，统计未被标记为中心点的高地数量，即为孤岛数量。]]></description><category></category></item></channel></rss>