- 博客(1)
- 收藏
- 关注
原创 Maximum SubArray Problem
Suppose that array A consists of the sequence of values −2, 1, −3, 4, −1, 2, 1, −5, 4. Then the contiguous subarray with the largest sum is 4, −1, 2, 1, with sum 6.This problem can be done in O(n) t
2008-05-18 13:46:00
298
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人