https://blog.youkuaiyun.com/bobten2008zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/bobten2008/article/details/9960773https://blog.youkuaiyun.com/bobten2008/article/details/9960773bobten2008Wed, 14 Aug 2013 10:49:35 +0800https://blog.youkuaiyun.com/bobten2008/article/details/9959229https://blog.youkuaiyun.com/bobten2008/article/details/9959229bobten2008Wed, 14 Aug 2013 09:34:28 +0800https://blog.youkuaiyun.com/bobten2008/article/details/9762655https://blog.youkuaiyun.com/bobten2008/article/details/9762655bobten2008Mon, 05 Aug 2013 09:43:23 +0800https://blog.youkuaiyun.com/bobten2008/article/details/9747425https://blog.youkuaiyun.com/bobten2008/article/details/9747425bobten2008Sun, 04 Aug 2013 15:48:02 +0800https://blog.youkuaiyun.com/bobten2008/article/details/9734979https://blog.youkuaiyun.com/bobten2008/article/details/9734979bobten2008Sat, 03 Aug 2013 20:29:45 +0800https://blog.youkuaiyun.com/bobten2008/article/details/6733977https://blog.youkuaiyun.com/bobten2008/article/details/6733977bobten2008Tue, 30 Aug 2011 22:07:54 +0800https://blog.youkuaiyun.com/bobten2008/article/details/6097197https://blog.youkuaiyun.com/bobten2008/article/details/6097197bobten2008Fri, 24 Dec 2010 22:50:00 +0800给定两个已排序数组，如何求第K个数。传统的做法就是类似归并排序的方式，时间
复杂度是O（N），这里给出一个二分法，时间复杂度是O（lgN）
 
#include #include #include //#define DEBUG #define MINV(a, b) ((a) <= (b) ? (a) : (b)) #define MAXV(a, b) ((a) >= (b) ? (a) :]]>https://blog.youkuaiyun.com/bobten2008/article/details/5997525https://blog.youkuaiyun.com/bobten2008/article/details/5997525bobten2008Tue, 09 Nov 2010 14:42:00 +0800https://blog.youkuaiyun.com/bobten2008/article/details/5951520https://blog.youkuaiyun.com/bobten2008/article/details/5951520bobten2008Tue, 19 Oct 2010 15:56:00 +0800value value){return -1;}else if(node_1->value == node_2->value){return 0;}else{return 1;}}/*对链式结构进行归并排序, 输入是待排序链表表头，返回值是排序后的表头指针sort_type = -1: 升序， 1:降]]>https://blog.youkuaiyun.com/bobten2008/article/details/5917128https://blog.youkuaiyun.com/bobten2008/article/details/5917128bobten2008Thu, 30 Sep 2010 20:50:00 +0800这段时间太忙，好久没有写优快云了，今天在重新看编程之美1.4买书问题的时候有了新的体会，于是就记录下来。看来真是“温故而知新”
 
1.5首先给出了一个动态规划版本，我第一次看编程之美的时候，自己一下子也想到了动态规划版本，就没往后看了。今天重新看了下才知道后面的贪心才是精华。
 
（1）按照正常的思路，我们有了以下贪心策略：购买Y5本5卷，购买Y4-Y5本4卷，购买Y3-Y4本3卷，购买Y3-Y4本3卷，购买Y2-Y3本2卷，购买Y1-Y2本1卷https://blog.youkuaiyun.com/bobten2008/article/details/5719044https://blog.youkuaiyun.com/bobten2008/article/details/5719044bobten2008Wed, 07 Jul 2010 16:54:00 +0800= (b) ? (a) : (b)) int array[MAX_LEN]; int getmaxv(int n) { if(n == 1) return array]]>https://blog.youkuaiyun.com/bobten2008/article/details/5698962https://blog.youkuaiyun.com/bobten2008/article/details/5698962bobten2008Mon, 28 Jun 2010 11:44:00 +0800https://blog.youkuaiyun.com/bobten2008/article/details/5691733https://blog.youkuaiyun.com/bobten2008/article/details/5691733bobten2008Thu, 24 Jun 2010 15:37:00 +0800https://blog.youkuaiyun.com/bobten2008/article/details/5688489https://blog.youkuaiyun.com/bobten2008/article/details/5688489bobten2008Wed, 23 Jun 2010 10:24:00 +0800https://blog.youkuaiyun.com/bobten2008/article/details/5688261https://blog.youkuaiyun.com/bobten2008/article/details/5688261bobten2008Wed, 23 Jun 2010 08:56:00 +0800https://blog.youkuaiyun.com/bobten2008/article/details/5668600https://blog.youkuaiyun.com/bobten2008/article/details/5668600bobten2008Sun, 13 Jun 2010 10:52:00 +0800我们经常使用的数的进制为“常数进制”，即始终逢p进1。例如，p进制数K可表示为
K = a0*p^0 + a1*p^1 + a2*p^2 + ... + an*p^n （其中0 <= ai <= p-1），
它可以表示任何一个自然数。

对于这种常数进制表示法，以及各种进制之间的转换大家应该是很熟悉的了，但大家可能很少听说变进制数。这里我要介绍一种特殊的变进制数，它能够被用来实现 全排列的Hash函数，并且该Hash函数能够实现完美的防碰撞和空间利用（不会]]>https://blog.youkuaiyun.com/bobten2008/article/details/5637168https://blog.youkuaiyun.com/bobten2008/article/details/5637168bobten2008Mon, 31 May 2010 16:54:00 +0800https://blog.youkuaiyun.com/bobten2008/article/details/5636524https://blog.youkuaiyun.com/bobten2008/article/details/5636524bobten2008Mon, 31 May 2010 14:33:00 +0800https://blog.youkuaiyun.com/bobten2008/article/details/5636010https://blog.youkuaiyun.com/bobten2008/article/details/5636010bobten2008Mon, 31 May 2010 11:07:00 +0800https://blog.youkuaiyun.com/bobten2008/article/details/5636008https://blog.youkuaiyun.com/bobten2008/article/details/5636008bobten2008Mon, 31 May 2010 11:06:00 +0800