<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:media="http://search.yahoo.com/mrss/"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>迷宫 - 四号程序员</title>
	<atom:link href="https://www.coder4.com/archives/tag/%E8%BF%B7%E5%AE%AB/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Sat, 26 Dec 2009 06:02:00 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.8.3</generator>
	<item>
		<title>迷宫问题的递归c++实现</title>
		<link>https://www.coder4.com/archives/220</link>
					<comments>https://www.coder4.com/archives/220#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sat, 26 Dec 2009 06:02:00 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[迷宫]]></category>
		<category><![CDATA[递归]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=220</guid>

					<description><![CDATA[迷宫问题问题描述：把一只小白鼠放入一个迷宫，问能否找到一条路让小白鼠出来。迷宫用数组表示。能通过则给出图&#8230;&#8230; 不同于上次用栈实现，这里的&#8220;栈&#8221;自动地由系统分配，So&#8230;&#8230; &#160; #include &#60;iostream&#62; struct Pos { &#160;int x; &#160;int y; }; int map[7][7]={{0,0,0,0,0,0,0},{0,1,0,1,1,1,0}[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/220/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>迷宫问题,C++的栈实现</title>
		<link>https://www.coder4.com/archives/208</link>
					<comments>https://www.coder4.com/archives/208#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sat, 26 Dec 2009 05:54:43 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[严蔚敏]]></category>
		<category><![CDATA[数据结构]]></category>
		<category><![CDATA[栈]]></category>
		<category><![CDATA[迷宫]]></category>
		<category><![CDATA[迷宫问题]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=208</guid>

					<description><![CDATA[Stack.h：定义了栈的基础操作和数据类型 #include &#60;iostream&#62; const int Stack_Size=9; const int Stack_Incricement=2; enum {OK=0,WRONG=-1}; typedef int Status; typedef struct { &#160;int x; &#160;int y; }Pos; typedef struct { &#160;Pos CurPos; &#160;int[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/208/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
