<?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/%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Sat, 02 Jun 2012 04:57:19 +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/3298</link>
					<comments>https://www.coder4.com/archives/3298#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sat, 02 Jun 2012 04:36:35 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[两个数]]></category>
		<category><![CDATA[数字之和]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=3298</guid>

					<description><![CDATA[原题是编程之美上的，数组无序。书上面的最优解法是先排序。。。所以有了这道题。 前提是有序，所以可以用O(n)解决。 即begin和end两个下标，往中间凑。如果sum满足输出。 如果大于目标，end--； 如果小于目标，begin++； void sum_print(int* arr, int n, int sum) { int i, j; for(i=0,j=n-1;i&#60;j &#38;&#38; i&#62;=0 &#38;&#38; j&#60;n; )[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/3298/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
