https://blog.youkuaiyun.com/wesweekyzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/wesweeky/article/details/6639287https://blog.youkuaiyun.com/wesweeky/article/details/6639287wesweekyWed, 27 Jul 2011 22:23:58 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6586814https://blog.youkuaiyun.com/wesweeky/article/details/6586814wesweekyTue, 05 Jul 2011 22:27:47 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6586249https://blog.youkuaiyun.com/wesweeky/article/details/6586249wesweekyTue, 05 Jul 2011 17:39:35 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6559778https://blog.youkuaiyun.com/wesweeky/article/details/6559778wesweekyTue, 21 Jun 2011 22:00:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6559768https://blog.youkuaiyun.com/wesweeky/article/details/6559768wesweekyTue, 21 Jun 2011 21:56:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6534356https://blog.youkuaiyun.com/wesweeky/article/details/6534356wesweekyThu, 09 Jun 2011 16:23:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6533902https://blog.youkuaiyun.com/wesweeky/article/details/6533902wesweekyThu, 09 Jun 2011 13:56:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6530788https://blog.youkuaiyun.com/wesweeky/article/details/6530788wesweekyWed, 08 Jun 2011 00:29:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6442101https://blog.youkuaiyun.com/wesweeky/article/details/6442101wesweekyTue, 24 May 2011 13:24:00 +0800题目：
输入一个二维bool数组B[,],求出全部连通域（8连接）
连通，就是格子上，8个方向上存在值相同，都是1.
连通域用点的集合表示，如List输出：List>

 
 ]]>https://blog.youkuaiyun.com/wesweeky/article/details/6442096https://blog.youkuaiyun.com/wesweeky/article/details/6442096wesweekyTue, 24 May 2011 13:20:00 +0800整数分划：
给定一个正整数 n , 一个由 r 个正整数组成的数组 λ ＝ ( x1 , x2, . . . . , xr) 如果满足 x1 + x2 + ··· + xr = n 且 x1 ≥ x2 ≥ ··· ≥ xr ≥ 1， 就称数组 λ 是 n 的一个分划。n 的所有不同的分划的个数记作 p(n)。
比如说 4 的分划 p(4) = 4 ：
　　4 = 4 ;
　　4 = 3 + 1 ;
　　4 = 2 + 2 ;
]]>https://blog.youkuaiyun.com/wesweeky/article/details/6442091https://blog.youkuaiyun.com/wesweeky/article/details/6442091wesweekyTue, 24 May 2011 13:15:00 +0800题目：
输入一个字符串，打印出该字符串中字符的所有排列和所有组合。例如输入字符串abc，则输出由字符a、b、c所能排列出来的所有字符串abc、acb、bac、bca、cab和cba。所有组合为：a、b、c、ab、ac、bc、abc。暂不考虑重复字符。
 ]]>https://blog.youkuaiyun.com/wesweeky/article/details/6440936https://blog.youkuaiyun.com/wesweeky/article/details/6440936wesweekyMon, 23 May 2011 22:14:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6440376https://blog.youkuaiyun.com/wesweeky/article/details/6440376wesweekyMon, 23 May 2011 17:34:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6439777https://blog.youkuaiyun.com/wesweeky/article/details/6439777wesweekyMon, 23 May 2011 15:10:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6439623https://blog.youkuaiyun.com/wesweeky/article/details/6439623wesweekyMon, 23 May 2011 14:25:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6402586https://blog.youkuaiyun.com/wesweeky/article/details/6402586wesweekySat, 07 May 2011 23:03:00 +0800问题：
    星期五的晚上，一帮同事在希格玛大厦附近的“硬盘酒吧”多喝了几杯。程序员多喝了几杯之后谈什么呢？自然是算法问题。有个同事说：“我以前在餐馆打工，顾客经常点非常多的烙饼。店里的饼大小不一，我习惯在到达顾客饭桌前，把一摞饼按照大小次序摆好——小的在上面，大的在下面。由于我一只手托着盘子，只好用另一只手，一次抓住最上面的几块饼，把它们上下颠倒个个儿，反复几次之后，这摞烙饼就排好序了。我后来想，这实际上是个有趣的排序问题：假设有n块大小不一的烙饼，那最少要翻几次，才能达到最后大小]]>https://blog.youkuaiyun.com/wesweeky/article/details/6402582https://blog.youkuaiyun.com/wesweeky/article/details/6402582wesweekySat, 07 May 2011 23:00:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6402564https://blog.youkuaiyun.com/wesweeky/article/details/6402564wesweekySat, 07 May 2011 22:49:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6368361https://blog.youkuaiyun.com/wesweeky/article/details/6368361wesweekyWed, 27 Apr 2011 23:53:00 +0800https://blog.youkuaiyun.com/wesweeky/article/details/6358950https://blog.youkuaiyun.com/wesweeky/article/details/6358950wesweekySun, 24 Apr 2011 16:08:00 +0800