2015年11月19日
Lintcode - Maximum Subarray III
摘要： Given an array of integers and a numberk, find knon-overlappingsubarrays which have the largest sum.The number in each subarray should becontiguous.Re... 阅读全文
posted @ 2015-11-19 03:59 fifi努刷题 阅读(361) 评论(0) 推荐(0)