2016年7月2日

Maximum Subarray III

摘要： Given an array of integers and a number k, find k non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguo 阅读全文

posted @ 2016-07-02 17:00 Sheryl Wang 阅读(270) 评论(0) 推荐(0) 编辑

Maximum Subarray II

摘要： Given an array of integers, find two non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguous. Return th 阅读全文

posted @ 2016-07-02 16:51 Sheryl Wang 阅读(123) 评论(0) 推荐(0) 编辑

导航