2016年2月20日
LeetCode -- Maximum Product Subarray
摘要： Question: Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2 阅读全文
posted @ 2016-02-20 21:03 江湖小妞 阅读(172) 评论(0) 推荐(0)