<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sudri的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sudri</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sudri]]></copyright><item><title><![CDATA[Huffman Codes]]></title><link>https://blog.youkuaiyun.com/sudri/article/details/42086599</link><guid>https://blog.youkuaiyun.com/sudri/article/details/42086599</guid><author>sudri</author><pubDate>Mon, 22 Dec 2014 21:38:05 +0800</pubDate><description><![CDATA[Research Project: Huffman Codes (30)
In 1953, David A. Huffman published his paper “A Method for the Constructionof Minimum-Redundancy Codes”,
 and hence printed his name in the history ofcomputer s]]></description><category></category></item><item><title><![CDATA[[DS] Hashing -- Shortest Ver ?]]></title><link>https://blog.youkuaiyun.com/sudri/article/details/40899201</link><guid>https://blog.youkuaiyun.com/sudri/article/details/40899201</guid><author>sudri</author><pubDate>Fri, 07 Nov 2014 21:11:47 +0800</pubDate><description><![CDATA[Requirement:



 Hashing



时间限制

100 ms




内存限制

32000 kB




代码长度限制

16000 B




判题程序

Standard


作者

HE, Qinming




Given a hash table of size N, we can d]]></description><category></category></item><item><title><![CDATA[PAT 1026 table tennis BONUS1]]></title><link>https://blog.youkuaiyun.com/sudri/article/details/40899059</link><guid>https://blog.youkuaiyun.com/sudri/article/details/40899059</guid><author>sudri</author><pubDate>Fri, 07 Nov 2014 21:05:48 +0800</pubDate><description><![CDATA[pat 1026
http://pat.zju.edu.cn/contests/pat-a-practise/1026]]></description><category></category></item><item><title><![CDATA[记录下一个渣渣的挣扎史]]></title><link>https://blog.youkuaiyun.com/sudri/article/details/40263345</link><guid>https://blog.youkuaiyun.com/sudri/article/details/40263345</guid><author>sudri</author><pubDate>Sun, 19 Oct 2014 16:01:51 +0800</pubDate><description><![CDATA[两年前，误打误撞进了ZJU


大学是一个把你自信心打碎然后重建起来的过程。
我深以为然。
一年后，
我已经完成了第一个过程。
可是
问题来了
请问怎么在ZJU成第二个过程？



诸多考败来浙的大神围绕在身边，学霸之上有学神，要么均绩轻松拿国奖，要么代码上造诣过人，更有甚者兼有两项。
非OI党，非学霸，智力一般，也许是终无逆袭之力了。
但终究不愿意放弃，开此博客记录]]></description><category></category></item><item><title><![CDATA[[DS][3-21]Implement two stacking using only one array]]></title><link>https://blog.youkuaiyun.com/sudri/article/details/40125635</link><guid>https://blog.youkuaiyun.com/sudri/article/details/40125635</guid><author>sudri</author><pubDate>Wed, 15 Oct 2014 23:51:22 +0800</pubDate><description><![CDATA[Source: 

Data Structures and Algorithm Analysis in C

The second edition (English version)

P87  3.26




Requirement:

write a program to evaluate a postfix expression




Analysis]]></description><category></category></item><item><title><![CDATA[[DS][3-19]Evaluate a postfix expression]]></title><link>https://blog.youkuaiyun.com/sudri/article/details/40121853</link><guid>https://blog.youkuaiyun.com/sudri/article/details/40121853</guid><author>sudri</author><pubDate>Wed, 15 Oct 2014 22:40:42 +0800</pubDate><description><![CDATA[Usually what we do to evaluate a postfix expression is to use a link list to implement a stack]]></description><category></category></item></channel></rss>