The gray code is a binary numeral system where
two successive values differ in only one bit.Given a non-negative
integernrepresenting the total number...
分类：
其他好文 时间：
2014-06-04 18:58:39
阅读次数：
277
VOIDKiAdjustIrpCredits ( VOID )其中 Number =
KeNumberProcessors;Prcb = KiProcessorBlock[Index];多核情况下调整每个CPU的IRP对象配额。在while
(Index Lookaside...
分类：
其他好文 时间：
2014-06-03 11:35:52
阅读次数：
254
算法入门经典训练指南88页练习：：这道题只要把原矩阵扩大4倍，那么其跟最大子矩阵的题目就很类似，把二维转化成一维,求最大的序列和，不过这个序列的长度不能超过n。长度不能超过n?
那这道题又跟hdu 3415HDU 3415 Max Sum of Max-K-sub-sequence (单调队列) 1...
分类：
其他好文 时间：
2014-05-30 18:14:46
阅读次数：
471
Given a binary tree containing digits
from0-9only, each root-to-leaf path could represent a number.An example is the
root-to-leaf path1->2->3which rep...
分类：
其他好文 时间：
2014-05-30 16:32:52
阅读次数：
226
Givennpoints on a 2D plane, find the maximum
number of points that lie on the same straight line./** * Definition for a
point. * struct Point { * ...
分类：
其他好文 时间：
2014-05-30 16:27:19
阅读次数：
238
Say you have an array for which theithelement
is the price of a given stock on dayi.Design an algorithm to find the maximum
profit. You may complete a...
分类：
其他好文 时间：
2014-05-30 16:19:05
阅读次数：
320
Given a binary tree, find the maximum path
sum.The path may start and end at any node in the tree.For example:Given the
below binary tree, 1 ...
分类：
其他好文 时间：
2014-05-30 16:10:54
阅读次数：
185
Given a stringSand a stringT, count the number
of distinct subsequences ofTinS.A subsequence of a string is a new string which
is formed from the orig...
分类：
其他好文 时间：
2014-05-30 15:58:40
阅读次数：
187
Given an array of integers, every element
appearsthreetimes except for one. Find that single one.Note:Your algorithm
should have a linear runtime comp...
分类：
其他好文 时间：
2014-05-30 15:15:53
阅读次数：
225
Given a binary tree, find its maximum depth.The
maximum depth is the number of nodes along the longest path from the root node
down to the farthest le...
分类：
其他好文 时间：
2014-05-30 15:03:42
阅读次数：
237
