苯苯的小木屋

摘要： Given an int array which might contain duplicates, find the largest subset of it which form a sequence. Eg. {1,6,10,4,7,9,5} then ans is 4,5,6,7 阅读全文

摘要： Give you an array which has n integers,it has both positive and negative integers.Now you need sort this array in a special way.After that,the negative integers should in the front,and the positive integers should in the back.Also the relative position should not be changed. eg. -1 1 3 -2 2 ans: -1 -2 1 3 2. 阅读全文

摘要： 最小堆 行列有序矩阵求第k大元素 阅读全文

摘要： C++ static、const和static const 以及它们的初始化 阅读全文

摘要： PIPE, FIFO semaphore, message queue, shared memory; key 阅读全文

摘要： 集线器，路由器，交换机之间的区别 阅读全文

摘要： 用C语言代码判别CPU的大小端模式 阅读全文

摘要： srandom(i); random(); 阅读全文

摘要： Boyer-Moore高质量实现代码详解与算法详解 阅读全文

摘要： KMP高质量代码实现详解，KMP算法详解 阅读全文