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],the...
分类：
其他好文 时间：
2014-10-21 22:52:27
阅读次数：
278
题目描述：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...
分类：
其他好文 时间：
2014-10-20 08:38:54
阅读次数：
125
Leetcode 加新题了Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array ...
分类：
其他好文 时间：
2014-10-19 15:36:04
阅读次数：
251
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Solution：此题是要求把罗马数字转换成数字。首先，学习一下罗马数字，参考罗马数字罗...
分类：
其他好文 时间：
2014-10-19 13:01:54
阅读次数：
248
Add Date2014-09-23Maximum Product SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest product....
分类：
编程语言 时间：
2014-10-17 00:33:53
阅读次数：
316
Problem：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.遍历一次输入的字符串，如果不满足类似4或者9的就直接加相应的数，否则减去...
分类：
其他好文 时间：
2014-10-16 02:41:51
阅读次数：
200
1.题目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]...
分类：
编程语言 时间：
2014-10-15 19:29:41
阅读次数：
228
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...
分类：
其他好文 时间：
2014-10-15 12:52:20
阅读次数：
160
Problem:Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.把阿拉伯数字转换为罗马数字输出。百度一下对应的 I V X L C D ...
分类：
其他好文 时间：
2014-10-15 01:28:39
阅读次数：
267
最大子序列积问题??
leetcode
Find the contiguous subarray within an array (containing at least one number)
线性时间算法...
分类：
其他好文 时间：
2014-10-13 23:44:27
阅读次数：
254
