- Category:
- Software Testing
- Tags:
-
- File Size:
- 11kb
- Update:
- 2012-11-26
- Downloads:
- 1 Times
- Uploaded by:
- 杨文
Description: Title: Enter a plastic array, the array positive also negative. Continuous one or more integer array is composed of a sub-array, and each has a sub-array and. Find the maximum and all sub-array. Required time complexity is O (n).
To Search:
File list (Check if you may need any files):
求所有子数组的和的最大值.docx
Download