- 博客(1)
- 资源 (5)
- 收藏
- 关注
原创 LeetCode Maximum subarray,最大子串问题
题目: Find the contiguoussubarray within an array (containing at least one number) which has the largestsum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] ha
2017-07-20 13:54:26 301
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人