<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>OJ on Neal&#39;s Blog</title>
		<link>https://madneal.com/tags/oj/</link>
		<description>Recent content in OJ on Neal&#39;s Blog</description>
		<generator>Hugo</generator>
		<language>zh-cn</language>
		
		
		
		
			<lastBuildDate>Sat, 08 Aug 2026 00:00:00 +0800</lastBuildDate>
		
			<atom:link href="https://madneal.com/tags/oj/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>剑指 Offer：二维数组中的查找</title>
				<link>https://madneal.com/post/%E5%89%91%E6%8C%87offer%E5%AD%A6%E4%B9%A0%E8%AF%BB%E4%B9%A6%E7%AC%94%E8%AE%B0--%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE/</link>
				<pubDate>Sat, 14 Nov 2015 00:00:00 +0800</pubDate>
				<guid>https://madneal.com/post/%E5%89%91%E6%8C%87offer%E5%AD%A6%E4%B9%A0%E8%AF%BB%E4%B9%A6%E7%AC%94%E8%AE%B0--%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE/</guid>
				<description>杨氏矩阵从右上角或左下角出发，每次剔除一行或一列，O(n+m) 查找目标数；含正确索引计算与边界条件。</description>
			</item>
			<item>
				<title>一道简单却易错的数组输入输出题</title>
				<link>https://madneal.com/post/%E4%B8%80%E4%B8%AA%E7%AE%80%E5%8D%95%E7%9A%84%E8%BE%93%E5%85%A5%E8%BE%93%E5%87%BA%E7%AE%97%E6%B3%95%E9%A2%98/</link>
				<pubDate>Sat, 11 Apr 2015 00:00:00 +0800</pubDate>
				<guid>https://madneal.com/post/%E4%B8%80%E4%B8%AA%E7%AE%80%E5%8D%95%E7%9A%84%E8%BE%93%E5%85%A5%E8%BE%93%E5%87%BA%E7%AE%97%E6%B3%95%E9%A2%98/</guid>
				<description>根据 a[i]*2-b[i] 生成数组 c：读题、处理「首元素是长度」的输入格式，并给出不易越界的 C++ 写法。</description>
			</item>
			<item>
				<title>验证歌德巴赫猜想：偶数拆成两素数且乘积最大</title>
				<link>https://madneal.com/post/%E6%AD%8C%E5%BE%B7%E5%B7%B4%E8%B5%AB%E7%8C%9C%E6%83%B3/</link>
				<pubDate>Sat, 11 Apr 2015 00:00:00 +0800</pubDate>
				<guid>https://madneal.com/post/%E6%AD%8C%E5%BE%B7%E5%B7%B4%E8%B5%AB%E7%8C%9C%E6%83%B3/</guid>
				<description>OJ 题：对每个偶数 n 找素数 a≤b、a+b=n 且 a*b 最大。解释从 n/2 向两端搜索的策略与素数判定优化。</description>
			</item>
	</channel>
</rss>
