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-06-18 12:32:58
阅读次数：
169
题目
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d =
target? Find all unique quadruplets in the array which gives the sum of target.
Note:
...
分类：
其他好文 时间：
2014-06-18 12:17:57
阅读次数：
179
题目
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the...
分类：
其他好文 时间：
2014-06-18 12:05:44
阅读次数：
244
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]...
分类：
其他好文 时间：
2014-06-18 11:41:52
阅读次数：
156
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to
m + n) to
hold additional ele...
分类：
其他好文 时间：
2014-06-17 23:05:13
阅读次数：
246
题目
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would ...
分类：
其他好文 时间：
2014-06-17 22:39:41
阅读次数：
274
Given n non-negative integers a1, a2,
..., an, where each represents a point at coordinate (i, ai). n vertical
lines are drawn such that the two endpoints of line i is at (i, ai) and (i,
0). Fin...
分类：
其他好文 时间：
2014-06-17 22:17:43
阅读次数：
325
题目
Given an array S of n integers, are there elements a, b, c in S such that a + b + c =
0? Find all unique triplets in the array which gives the sum of zero.
Note:
Elements in a tr...
分类：
其他好文 时间：
2014-06-17 22:04:49
阅读次数：
292
Given two words word1 and word2, find the minimum number of steps required to convert
word1 to word2. (each operation is counted as 1 step.)
You have the following 3 operations permitted...
分类：
其他好文 时间：
2014-06-17 21:43:38
阅读次数：
219
一：截图二：快速排序详解快速排序法（QuickSort）是一种非常快的对比排序方法。它也Divide-And-Conquer思想的实现之一。自从其产生以来，快速排序理论得到了极大的改进，然而在实际中却十分难以编程出正确健壮的代码。本文将对快速排序算法的基本理论和编程实践方面做作一个全面的讲解。在本文...
分类：
其他好文 时间：
2014-06-17 21:10:17
阅读次数：
244
