<?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%A0%86/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Tue, 12 Mar 2013 13:37:39 +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>Python使用heapq实现小顶堆（TopK大）、大顶堆（BtmK小）</title>
		<link>https://www.coder4.com/archives/3844</link>
					<comments>https://www.coder4.com/archives/3844#comments</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Tue, 12 Mar 2013 08:34:40 +0000</pubDate>
				<category><![CDATA[Python]]></category>
		<category><![CDATA[Bottomk]]></category>
		<category><![CDATA[heapq]]></category>
		<category><![CDATA[Topk]]></category>
		<category><![CDATA[优先队列]]></category>
		<category><![CDATA[堆]]></category>
		<category><![CDATA[大顶堆]]></category>
		<category><![CDATA[小顶堆]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=3844</guid>

					<description><![CDATA[需1求：给出N长的序列，求出TopK大的元素，使用小顶堆，heapq模块实现。 import heapq import random class TopkHeap(object): def __init__(self, k): self.k = k self.data = [] def Push(self, elem): if len(self.data) &#60; self.k:[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/3844/feed</wfw:commentRss>
			<slash:comments>5</slash:comments>
		
		
			</item>
		<item>
		<title>《数据结构》读书笔记 第四章 堆分配存储串及基本操作</title>
		<link>https://www.coder4.com/archives/233</link>
					<comments>https://www.coder4.com/archives/233#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sat, 26 Dec 2009 06:08:33 +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=233</guid>

					<description><![CDATA[堆分配前天的普通串比有如下优点： （1）节省空间，用多少，分配多少！ （2）struct结构体体积小，减少了位对齐的机会，提高了效率 缺点： （1）用了new所以记得delete （2）结构上字符串从0开始，这个下标是很折磨人的 HString.h #include &#60;iostream&#62; enum {OK=0,WRONG=-1}; typedef int Status; struct HString { &#160;char *chars; &#160;int len; }[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/233/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
