题目描述：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,...
分类：
编程语言 时间：
2014-09-25 13:26:28
阅读次数：
281
分治法，采用一种“分治(divide-and-conquer)”的...
分类：
其他好文 时间：
2014-09-24 18:58:57
阅读次数：
283
Flow Problem
Problem Description
Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph....
分类：
其他好文 时间：
2014-09-24 18:35:37
阅读次数：
272
leetcode 新增题目Maximum Product Subarray...
分类：
其他好文 时间：
2014-09-24 17:56:57
阅读次数：
148
【求最大深度】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.
这里说的最大深度是指最深叶子节点到根节点的路径长度
...
分类：
其他好文 时间：
2014-09-24 16:09:37
阅读次数：
200
题目信息：
1007. Maximum Subsequence Sum (25)
时间限制
400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
Given a sequence of K i...
分类：
其他好文 时间：
2014-09-24 11:12:56
阅读次数：
364
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.
Your goal i...
分类：
其他好文 时间：
2014-09-23 20:15:26
阅读次数：
142
Configuring the Gesture Recognizer@property(nonatomic) NSUInteger maximumNumberOfTouches//The maximum number of fingers that can be touching the view ...
分类：
其他好文 时间：
2014-09-22 19:04:23
阅读次数：
241
[leetcode]Given a binary tree, find its maximum depth....
分类：
其他好文 时间：
2014-09-22 13:24:42
阅读次数：
114
题目：
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 as many transactions as you like (i...
分类：
其他好文 时间：
2014-09-21 03:10:29
阅读次数：
265
