Tony's Log

Algorithms, Distributed System, Machine Learning
  博客园 :: 首页 :: 新随笔 :: 联系 :: 订阅 :: 管理 ::

10 2014 档案

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 阅读(144) 评论(0) 推荐(0)