﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>博客园-ShanTou University::happyhippy-随笔分类-程序=数据结构+算法</title><link>http://www.cnblogs.com/happyhippy/category/79941.html</link><description>

Silent Void
body{filter:gray;}</description><language>zh-cn</language><lastBuildDate>Wed, 21 May 2008 14:30:20 GMT</lastBuildDate><pubDate>Wed, 21 May 2008 14:30:20 GMT</pubDate><ttl>60</ttl><item><title>面试题解(4):求排列、组合</title><link>http://www.cnblogs.com/happyhippy/archive/2008/03/10/1099342.html</link><dc:creator>Silent Void</dc:creator><author>Silent Void</author><pubDate>Mon, 10 Mar 2008 11:47:00 GMT</pubDate><guid>http://www.cnblogs.com/happyhippy/archive/2008/03/10/1099342.html</guid><wfw:comment>http://www.cnblogs.com/happyhippy/comments/1099342.html</wfw:comment><comments>http://www.cnblogs.com/happyhippy/archive/2008/03/10/1099342.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/happyhippy/comments/commentRss/1099342.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/happyhippy/services/trackbacks/1099342.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:   N个元素的集合中，任选M个元素所构成的排列P(M in N)、组合C(M in N)&nbsp;&nbsp;<a href='http://www.cnblogs.com/happyhippy/archive/2008/03/10/1099342.html'>阅读全文</a><img src ="http://www.cnblogs.com/happyhippy/aggbug/1099342.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://happyhippy.cnblogs.com/" target="_blank">Silent Void</a> 2008-03-10 19:47 <a href="http://www.cnblogs.com/happyhippy/archive/2008/03/10/1099342.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试题解(2):loop相关</title><link>http://www.cnblogs.com/happyhippy/archive/2008/02/03/1063261.html</link><dc:creator>Silent Void</dc:creator><author>Silent Void</author><pubDate>Sun, 03 Feb 2008 01:54:00 GMT</pubDate><guid>http://www.cnblogs.com/happyhippy/archive/2008/02/03/1063261.html</guid><wfw:comment>http://www.cnblogs.com/happyhippy/comments/1063261.html</wfw:comment><comments>http://www.cnblogs.com/happyhippy/archive/2008/02/03/1063261.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cnblogs.com/happyhippy/comments/commentRss/1063261.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/happyhippy/services/trackbacks/1063261.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: loop&nbsp;&nbsp;<a href='http://www.cnblogs.com/happyhippy/archive/2008/02/03/1063261.html'>阅读全文</a><img src ="http://www.cnblogs.com/happyhippy/aggbug/1063261.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://happyhippy.cnblogs.com/" target="_blank">Silent Void</a> 2008-02-03 09:54 <a href="http://www.cnblogs.com/happyhippy/archive/2008/02/03/1063261.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试题解(1):单向链表相关</title><link>http://www.cnblogs.com/happyhippy/archive/2008/02/02/1062735.html</link><dc:creator>Silent Void</dc:creator><author>Silent Void</author><pubDate>Sat, 02 Feb 2008 08:53:00 GMT</pubDate><guid>http://www.cnblogs.com/happyhippy/archive/2008/02/02/1062735.html</guid><wfw:comment>http://www.cnblogs.com/happyhippy/comments/1062735.html</wfw:comment><comments>http://www.cnblogs.com/happyhippy/archive/2008/02/02/1062735.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/happyhippy/comments/commentRss/1062735.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/happyhippy/services/trackbacks/1062735.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 0. 一个单向链表，请设计算法判断该链表中有没有环？<br>1. 两个单向链表，有可能交叉，请设计算法判断是否交叉，如果交叉，返回交叉点。&nbsp;&nbsp;<a href='http://www.cnblogs.com/happyhippy/archive/2008/02/02/1062735.html'>阅读全文</a><img src ="http://www.cnblogs.com/happyhippy/aggbug/1062735.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://happyhippy.cnblogs.com/" target="_blank">Silent Void</a> 2008-02-02 16:53 <a href="http://www.cnblogs.com/happyhippy/archive/2008/02/02/1062735.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>