Similar to maximum sum subarray, but need a gmin to record the global minimum to handle negative numbermultiplication. 1 class Solution { 2 public: 3 ...
分类:
其他好文 时间:
2015-03-21 06:22:49
阅读次数:
118
Sorting solution O(nlogn): 1 class Solution { 2 public: 3 int maximumGap(vector &num) { 4 int len = num.size(), result = 0; 5 if (...
分类:
其他好文 时间:
2015-03-21 06:22:24
阅读次数:
139
如何更改MyEclipse代码自动换行的长度?window->preferences->java->code style->formatter->edit->line wrapping->maximum line width 修改后保存就OK了
分类:
系统相关 时间:
2015-03-20 15:57:43
阅读次数:
192
jboss 7 开发提示如下: More than the maximum number of request parameters (GET plus POST) for a single request ([512]) were detected.Any parameters beyond this limit have been ignored. To change th...
分类:
其他好文 时间:
2015-03-20 13:04:48
阅读次数:
267
使用spring定时任务出现:Caused by: java.lang.IllegalArgumentException: Range exceeds maximum (60): 10000,原来是cron表达式第一个值不能大于60,60也不行,附录cron表达式介绍: CronTrigger CronTriggers往...
分类:
编程语言 时间:
2015-03-20 11:12:36
阅读次数:
245
Level 1 - Process Validation1. maximum arrival countDefine the number of token instances the process will generate (or trigger)在一开始定义多少token将被处理2.Gate...
分类:
其他好文 时间:
2015-03-19 21:37:03
阅读次数:
109
Given a sequence of K integers { N1, N2, ..., NK}. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj} where 1 //using namespace std;//cons...
分类:
其他好文 时间:
2015-03-19 16:16:34
阅读次数:
163
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 ...
分类:
其他好文 时间:
2015-03-19 12:58:48
阅读次数:
116
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.思路分析:这题比较简单,关于树的题目通常都可以用递归解决,这题也不例外,递归解法的思...
分类:
其他好文 时间:
2015-03-19 06:23:34
阅读次数:
126
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 if the array contains less than 2 elements.You may...
分类:
其他好文 时间:
2015-03-18 09:04:03
阅读次数:
154