错误提示信息：The load generator is currently running the maximum number of Vusers of this type场景：LR创建6000个Vuser，当达到5000后，剩下1000个Vuser出现错误，提示如上。解决：1. 排除Load ...
分类：
其他好文 时间：
2015-08-26 19:54:17
阅读次数：
145
Maximum repetition substring
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 8067
Accepted: 2463
Description
The repetition number of a string is defined...
分类：
编程语言 时间：
2015-08-26 14:05:27
阅读次数：
176
palindromeQuestion 1Longest Palindromic SubstringGiven a stringS, find the longest palindromic substring inS. You may assume that the maximum length o...
分类：
其他好文 时间：
2015-08-26 01:31:55
阅读次数：
113
此处的三个题跟Maximum Subarray，可以先看此题
I)
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, b...
分类：
其他好文 时间：
2015-08-25 19:40:20
阅读次数：
202
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [?2,1,?3,4,?1,2,1,?5,4],
the contiguous subarray [4,?1,2,1] ha...
分类：
其他好文 时间：
2015-08-25 16:34:50
阅读次数：
164
作为一个非科班出身的程序员，还是很有必要刷刷题的。之前有个大牛说，菜鸟刷题可以从AC率高的刷起，这样可以快速培养信心。将LeetCode的题目按照AC率从高到低排序，第一道题目为 【Maximum Depth of Binary Tree】。 从题目就可以看出，是求二叉树的最大深度。深度的概念...
分类：
其他好文 时间：
2015-08-25 16:21:40
阅读次数：
80
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-08-21 08:16:21
阅读次数：
205
leetcode - Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given ...
分类：
其他好文 时间：
2015-08-20 12:17:24
阅读次数：
130
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-08-20 06:47:41
阅读次数：
116
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-08-19 23:26:54
阅读次数：
223
