[leetcode]Given two integers n and k, return all possible combinations of k numbers out of 1 ... n....
分类：
其他好文 时间：
2014-09-19 10:07:55
阅读次数：
209
题目描述：
Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17...
分类：
其他好文 时间：
2014-09-18 23:50:54
阅读次数：
237
Grunt入门教程之二
Concat插件
concat是grunt中用来做文件连接的常用插件，比如说你写了一个类库，有三大模块，如：
one.js
two.js
three.js
当你的项目准备发布的时候，你可能需要将这三个模块合并成一个大的模块all.js，这样做可以减少H...
分类：
其他好文 时间：
2014-09-18 22:21:44
阅读次数：
201
题目：
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 and the nodes have the same value.
刷题打卡中...
分类：
其他好文 时间：
2014-09-18 16:33:24
阅读次数：
205
There are two method to call .net DLL in SQLSERVER.The first one is to use the sql clr but it has a lot of limit.The second method is to use SSIS pack...
分类：
数据库 时间：
2014-09-18 14:44:13
阅读次数：
246
In recent years Linux distributions started treating security more seriously. Out of many security features two are directly affecting C programmers:-...
分类：
其他好文 时间：
2014-09-18 14:31:34
阅读次数：
589
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function ...
分类：
其他好文 时间：
2014-09-18 13:11:03
阅读次数：
135
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target valu...
分类：
其他好文 时间：
2014-09-18 13:06:33
阅读次数：
186
[leetcode]Divide Two Integers...
分类：
其他好文 时间：
2014-09-18 11:38:13
阅读次数：
189
Binary String Matching
时间限制：3000 ms | 内存限制：65535 KB
难度：3
描述
Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as ...
分类：
其他好文 时间：
2014-09-18 11:34:53
阅读次数：
178
