<![CDATA[kkForWork的专栏]]>https://blog.csdn.net/kkForWorkzh-cnhttps://blog.csdn.net/<![CDATA[给定一个奇数n，比如n=3，生成1到n平方的数，如1到9，填入九宫格，使得横竖斜的和都相等。]]>https://blog.csdn.net/kkForWork/article/details/48348739https://blog.csdn.net/kkForWork/article/details/48348739kkForWorkThu, 10 Sep 2015 20:39:59 +0800<![CDATA[面试算法题]]>https://blog.csdn.net/kkForWork/article/details/48340239https://blog.csdn.net/kkForWork/article/details/48340239kkForWorkThu, 10 Sep 2015 13:59:29 +0800<![CDATA[k链表翻转]]>https://blog.csdn.net/kkForWork/article/details/48324001https://blog.csdn.net/kkForWork/article/details/48324001kkForWorkWed, 09 Sep 2015 21:53:03 +0800<![CDATA[楼层扔鸡蛋问题]]>https://blog.csdn.net/kkForWork/article/details/48207001https://blog.csdn.net/kkForWork/article/details/48207001kkForWorkFri, 04 Sep 2015 09:59:16 +0800<![CDATA[原地归并排序]]>https://blog.csdn.net/kkForWork/article/details/48007789https://blog.csdn.net/kkForWork/article/details/48007789kkForWorkWed, 26 Aug 2015 18:35:53 +0800<![CDATA[互斥量和信号量的区别]]>https://blog.csdn.net/kkForWork/article/details/47998817https://blog.csdn.net/kkForWork/article/details/47998817kkForWorkWed, 26 Aug 2015 09:46:33 +0800<![CDATA[聚集索引和非聚集索引（整理）]]>https://blog.csdn.net/kkForWork/article/details/47957025https://blog.csdn.net/kkForWork/article/details/47957025kkForWorkMon, 24 Aug 2015 20:25:19 +0800<![CDATA[C/C++之回调函数]]>https://blog.csdn.net/kkForWork/article/details/47955331https://blog.csdn.net/kkForWork/article/details/47955331kkForWorkMon, 24 Aug 2015 18:59:57 +0800<![CDATA[条件覆盖，路径覆盖，语句覆盖，分支覆盖解释]]>https://blog.csdn.net/kkForWork/article/details/47909391https://blog.csdn.net/kkForWork/article/details/47909391kkForWorkSun, 23 Aug 2015 19:57:57 +0800<![CDATA[fork之后子进程到底复制了父进程什么]]>https://blog.csdn.net/kkForWork/article/details/47835741https://blog.csdn.net/kkForWork/article/details/47835741kkForWorkFri, 21 Aug 2015 15:51:11 +0800<![CDATA[寻找数组中的第二大数]]>https://blog.csdn.net/kkForWork/article/details/47426887https://blog.csdn.net/kkForWork/article/details/47426887kkForWorkTue, 11 Aug 2015 20:53:23 +0800<![CDATA[rand5()产生rand7()]]>https://blog.csdn.net/kkForWork/article/details/47293589https://blog.csdn.net/kkForWork/article/details/47293589kkForWorkWed, 05 Aug 2015 10:53:00 +0800<![CDATA[利用后缀数组求最长的重复子串]]>https://blog.csdn.net/kkForWork/article/details/47291409https://blog.csdn.net/kkForWork/article/details/47291409kkForWorkWed, 05 Aug 2015 09:34:20 +0800<![CDATA[最长递增子序列（LIS）]]>https://blog.csdn.net/kkForWork/article/details/47256669https://blog.csdn.net/kkForWork/article/details/47256669kkForWorkMon, 03 Aug 2015 15:21:03 +0800<![CDATA[动态维护数列的中位数]]>https://blog.csdn.net/kkForWork/article/details/47066471https://blog.csdn.net/kkForWork/article/details/47066471kkForWorkSun, 26 Jul 2015 12:42:45 +0800<![CDATA[操作系统内存管理之 内部碎片vs外部碎片]]>https://blog.csdn.net/kkForWork/article/details/47065793https://blog.csdn.net/kkForWork/article/details/47065793kkForWorkSun, 26 Jul 2015 10:20:09 +0800<![CDATA[统计1到n出现的1的个数（不能用字符串）]]>https://blog.csdn.net/kkForWork/article/details/46952743https://blog.csdn.net/kkForWork/article/details/46952743kkForWorkSun, 19 Jul 2015 09:50:43 +0800<![CDATA[多重继承和虚继承的内存布局]]>https://blog.csdn.net/kkForWork/article/details/46866935https://blog.csdn.net/kkForWork/article/details/46866935kkForWorkMon, 13 Jul 2015 19:48:24 +0800<![CDATA[leetcode之 median of two sorted arrays]]>https://blog.csdn.net/kkForWork/article/details/46766225https://blog.csdn.net/kkForWork/article/details/46766225kkForWorkSun, 05 Jul 2015 22:05:45 +0800、 证明也很简单，可以采用反证法。假设A[k/2-1]大于合并之后的第k小值，我们]]><![CDATA[计数排序、桶排序和基数排序]]>https://blog.csdn.net/kkForWork/article/details/46761907https://blog.csdn.net/kkForWork/article/details/46761907kkForWorkSun, 05 Jul 2015 10:49:56 +0800