<?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/%E5%8F%8D%E8%BD%AC/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Thu, 31 May 2012 03:47:35 +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>反转句子中的单词</title>
		<link>https://www.coder4.com/archives/3275</link>
					<comments>https://www.coder4.com/archives/3275#comments</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Thu, 31 May 2012 03:47:35 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[单词]]></category>
		<category><![CDATA[反转]]></category>
		<category><![CDATA[句子]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=3275</guid>

					<description><![CDATA[题目：输入一个英文句子，翻转句子中单词的顺序，但单词内字符的顺序不变。 句子中单词以空格符隔开。为简单起见，标点符号和普通字母一样处理。 例如输入“I am a student.”，则输出“student. a am I”。 这种题是很无聊的，而且用istream什么就没有可以做的了，思路：倒着遍历字符串，查找到一个空格后，输出本空格与上次空格之间的内容。可以用\0临时替代printf。 代码如下： #include &#60;stdio.h&#62; #include &#60;[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/3275/feed</wfw:commentRss>
			<slash:comments>2</slash:comments>
		
		
			</item>
		<item>
		<title>链表的就地反转 c语言实现</title>
		<link>https://www.coder4.com/archives/112</link>
					<comments>https://www.coder4.com/archives/112#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Thu, 26 Nov 2009 08:53:01 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[反转]]></category>
		<category><![CDATA[递归]]></category>
		<category><![CDATA[链表]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=112</guid>

					<description><![CDATA[#include typedef struct node { int num; struct node *next; }*LINK,NODE; LINK link_rev(LINK head); LINK link_cr(int num); void link_show(LINK head); int main() { LINK *p,head,head1; head=link_cr(5); printf("Now create 5 NODE LINK,print:");[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/112/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
