文件名称:zuidazhi
介绍说明－－下载内容均来自于网络，请自行研究使用
题目：输入一个整形数组，数组里有正数也有负数。数组中连续的一个或多个整数组成一个子数组，每个
子数组都有一个和。求所有子数组的和的最大值。要求时间复杂度为O(n)。
-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).
子数组都有一个和。求所有子数组的和的最大值。要求时间复杂度为O(n)。
-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).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
求所有子数组的和的最大值.docx