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 target, whe...
分类：
其他好文 时间：
2014-06-09 23:14:45
阅读次数：
264
【题目】
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[
[2],
[3,4],
[6,5,7],
[4,1,8,3]
]
The minimum path sum from top to...
分类：
其他好文 时间：
2014-06-08 17:52:45
阅读次数：
235
POJ 2356 find multiple
题意：
输入一个正整数 N ，接着输入 N 和 正整数 nums[1], nums[2], ... ... , nums[N]，
试问可否从这 N 个正整数中找出一组连续的数，它们的和能被 N 整除。
思路：
鸽巢原理，构造一个序列 sums[1] = nums[1], sums[2] = nums[1] + nums[2], ... ....
分类：
其他好文 时间：
2014-06-08 15:12:34
阅读次数：
213
【题目】
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
...
分类：
其他好文 时间：
2014-06-08 15:11:58
阅读次数：
298
前面的步骤按说明书上就没有问题，但在移植内核时，当进行到
make ARCH=arm CROSS_COMPILE=arm-none-linux-gnueabi- menuconfig
出现以下错误：
*** Unable to find the ncurses libraries or the
*** required header files.
*** 'make menuco...
分类：
其他好文 时间：
2014-06-08 10:40:46
阅读次数：
184
题目
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 leaf node.
方法
使用DFS对树进行遍...
分类：
其他好文 时间：
2014-06-08 10:26:33
阅读次数：
207
如果你执行下以下命令基本上会在Oracle软件目录下会发现两个root.sh的脚本
[oracle@rh64 Templates]$ find /u01/ -name root.sh |xargs ls -ltr
-rwxrwx--- 1 oracle oinstall 10 May 14 02:37 /u01/app/db11g/product/11.2.0/dbhome_1/invent...
分类：
数据库 时间：
2014-06-08 09:50:59
阅读次数：
946
题目：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length...
分类：
其他好文 时间：
2014-06-08 03:06:52
阅读次数：
221
Problem Description
A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.
You are to find all the hat’s words in a dictionary.
In...
分类：
其他好文 时间：
2014-06-08 03:02:14
阅读次数：
323
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 target, whe...
分类：
其他好文 时间：
2014-06-08 02:12:04
阅读次数：
216
