whereis 文件名 结果：产生文件路径
find / -name 文件名 结果：产生文件路径
hadoop fs -mkdir
hadoop fs -put 文件路径名 主机下的文件路径名
hadoop fs -ls / 查看当前路径下的所有文件
eclipse下安装hadoop插件
复制hadoop目录下的hadoop...
分类：
系统相关 时间：
2015-08-05 16:27:55
阅读次数：
262
Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.For"(()", the longest...
分类：
其他好文 时间：
2015-08-05 12:27:30
阅读次数：
108
题目：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...
分类：
其他好文 时间：
2015-08-05 07:44:48
阅读次数：
139
题目：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsu...
分类：
其他好文 时间：
2015-08-05 06:38:24
阅读次数：
95
There are two kinds of errors that Basis can find.Syntaxerrors occur during the parsing of input code, and are caused by grammatically incorrect state...
分类：
其他好文 时间：
2015-08-05 00:43:00
阅读次数：
112
问题：Given an array of N integer, find the length of the longest increasing subsequence.For example, given [1,-5,4,5,10,-1,-5,7], the longest increasing...
分类：
编程语言 时间：
2015-08-05 00:40:24
阅读次数：
154
Problem Difinition:Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the arr...
分类：
其他好文 时间：
2015-08-05 00:39:34
阅读次数：
144
Given an array ofnpositive integers and a positive integers, find the minimal length of a subarray of which the sum ≥s. If there isn't one, return 0 i...
分类：
其他好文 时间：
2015-08-05 00:30:29
阅读次数：
146
点击打开hdu1258
Problem Description
Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [...
分类：
其他好文 时间：
2015-08-04 23:06:55
阅读次数：
188
Two Sum
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 th...
分类：
其他好文 时间：
2015-08-04 23:00:26
阅读次数：
104
