算法：1.
对root的左子树做处理，让左子树的根节点作为，根节点的右子树，并让右子树作为左子树根节点的右子树的子树2. 递归遍历右子树public void
flatten(TreeNode root) { if(root==null){ return; ...
分类：
其他好文 时间：
2014-05-26 23:39:49
阅读次数：
253
modesecurity
的特征：https://github.com/SpiderLabs/owasp-modsecurity-crs/tree/master/base_rulessnort的规则：http://cs.uccs.edu/~cs591/ids/snort/snort2_9_0/rul...
分类：
其他好文 时间：
2014-05-26 22:45:06
阅读次数：
248
Suffix Tree to get maximum symmetrical
sub-string.
分类：
其他好文 时间：
2014-05-23 04:21:13
阅读次数：
237
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a litt...
分类：
其他好文 时间：
2014-05-23 02:27:26
阅读次数：
587
判断二维字符串是否满足下面条件：
on both diagonals of the square paper all letters are the same;
all other squares of the paper (they are not on the diagonals) contain the same letter that is different from the...
分类：
其他好文 时间：
2014-05-23 02:21:01
阅读次数：
294
Problem 4: Largest palindrome product
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest pal...
分类：
其他好文 时间：
2014-05-22 18:48:46
阅读次数：
355
Given two binary trees, write a function to
check if they are equal or not.Two binary trees are considered equal if they are
structurally identical an...
分类：
其他好文 时间：
2014-05-22 16:46:03
阅读次数：
173
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-22 16:05:56
阅读次数：
239
Microsoft Open Technologies has recently
released a Portable Class Libraryfor SQLite. Thanks to it, we can use SQLite in
the same way in all the suppo...
分类：
数据库 时间：
2014-05-22 15:06:51
阅读次数：
428
【题目】
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited number of times.
Note:
All numbers (including target) w...
分类：
其他好文 时间：
2014-05-21 15:21:28
阅读次数：
292
