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 comple ...
分类：
其他好文 时间：
2016-08-19 12:40:00
阅读次数：
175
Maximum repetition substring Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9083 Accepted: 2782 Description The repetition number of a str ...
分类：
其他好文 时间：
2016-08-17 21:21:28
阅读次数：
229
Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assum ...
分类：
其他好文 时间：
2016-08-16 21:47:00
阅读次数：
133
Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assum ...
分类：
其他好文 时间：
2016-08-16 10:28:50
阅读次数：
152
原题如下： Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique ...
分类：
其他好文 时间：
2016-08-15 18:59:55
阅读次数：
146
Given a binary tree, find the maximum path sum from root. The path may end at any node in the tree and contain at least one node in it. 给一棵二叉树，找出从根节点出 ...
分类：
其他好文 时间：
2016-08-15 17:13:54
阅读次数：
161
[题目] 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 farth ...
分类：
其他好文 时间：
2016-08-14 14:22:35
阅读次数：
92
binary-tree-maximum-path-sum binary-tree-maximum-path-sum 题目描述 Given a binary tree, find the maximum path sum. The path may start and end at any node ...
分类：
其他好文 时间：
2016-08-14 07:17:05
阅读次数：
139
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 l ...
分类：
其他好文 时间：
2016-08-13 19:34:06
阅读次数：
98
记录INFO级别的日志，通常用于调试。 属性说明： !channel – !type – The component type name, needs to be logger maxBytesToLog 16 Maximum number of bytes of the Event body to ...
分类：
其他好文 时间：
2016-08-13 01:04:56
阅读次数：
213
