Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
分类：
其他好文 时间：
2015-04-09 13:28:05
阅读次数：
94
题目：
Given a binary tree, find the maximum path sum.
The path may start and end at any node in the tree.
For example:
Given the below binary tree,
1
/ 2 3
思路：刚开始思路...
分类：
其他好文 时间：
2015-04-09 11:52:49
阅读次数：
107
1,0516-787 extendlv: Maximum allocation for logical volume hd3 is 512smitt chlv改max logical partion值 or 使用Cli命令行 chlv -x 值M lvName;
分类：
其他好文 时间：
2015-04-08 21:24:58
阅读次数：
116
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2015-04-08 00:54:17
阅读次数：
113
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 =0)25 {26 ...
分类：
其他好文 时间：
2015-04-07 22:58:11
阅读次数：
214
从今天起，模仿《从零单排》系列，菜鸡单刷LeetCode！...
分类：
其他好文 时间：
2015-04-07 21:51:12
阅读次数：
129
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2015-04-07 21:31:44
阅读次数：
120
题目：
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
De...
分类：
其他好文 时间：
2015-04-07 19:42:29
阅读次数：
108
Say you have an array for which the ith element is the price of a given stock on day
i.
Design an algorithm to find the maximum profit. You may complete at most
k transactions.
Note:
You may not ...
分类：
其他好文 时间：
2015-04-07 10:03:35
阅读次数：
154
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
分类：
其他好文 时间：
2015-04-06 15:29:04
阅读次数：
223
