53. Maximum Subarray (Array; DP)
摘要:
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2, 阅读全文
posted @ 2015-10-06 15:57 joannae 阅读(183) 评论(0) 推荐(0) 编辑