Tony's Log

Algorithms, Distributed System, Machine Learning

:: :: :: :: :: ::

:: ::

公告

2014年10月11日

LeetCode "Maximum Product Subarray"

摘要： Intuitively there must a O(n) solution.First I tried a bottom-up DP solution but it had a TLE:class Solution {public: int maxProduct(int A[], int n... 阅读全文

posted @ 2014-10-11 07:41 Tonix 阅读(143) 评论(0) 推荐(0)