Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4],t ...
分类：
编程语言 时间：
2016-07-03 21:15:16
阅读次数：
176
题目链接：https://leetcode.com/problems/sliding-window-maximum/题目：
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only s...
题目：传送门 题意：求n个数的最大公约数，暴力不会超时，难点在没有个数控制的输入。 题解：用特殊方法输入。 ...
分类：
其他好文 时间：
2016-07-03 18:51:33
阅读次数：
113
Given an array of integers, find two non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguous. Return th ...
分类：
其他好文 时间：
2016-07-02 17:33:10
阅读次数：
137
Given an array of integers and a number k, find k non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguo ...
分类：
其他好文 时间：
2016-07-02 17:30:12
阅读次数：
162
3638: Cf172 k-Maximum Subsequence Sum Description 给一列数，要求支持操作： 1.修改某个数的值 2.读入l,r,k，询问在[l,r]内选不相交的不超过k个子段，最大的和是多少。 给一列数，要求支持操作： 1.修改某个数的值 2.读入l,r,k，询问在 ...
分类：
其他好文 时间：
2016-07-01 21:20:37
阅读次数：
476
Find the contiguous subarray within an array (containing at least one number) which has the largest product. Example For example, given the array [2,3 ...
分类：
其他好文 时间：
2016-07-01 06:45:49
阅读次数：
307
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-06-30 12:27:33
阅读次数：
141
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, ...
分类：
其他好文 时间：
2016-06-29 21:53:36
阅读次数：
119
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, ...
分类：
其他好文 时间：
2016-06-29 19:07:16
阅读次数：
157
