最大子串和(再议)
■.实现方法:
采用一般的循环结构,对整个串只需要一遍扫描即可求出最大子串和。
■.实现思想:
●.观察整个整数串的最大子串分布,会发现
●.最大串不可能是从负数开始;
●.也不会包含顺序累加和为负值的子串;
●.只有顺序累加和为正的子串才有可能是最大子串的一部分。
■.代码实现(C++):
template <typename Type>
Type maxSubSum(Type *array, int length){
Type maxSum = 0, currMaxSum = 0;
for(int i = 0; i < length; i++){
currMaxSum += array[i];
if(currMaxSum > maxSum)
maxSum = currMaxSum;
else if(currMaxSum < 0)
currMaxSum = 0;
}
return maxSum;
}
■.测试代码:
int main()
{
int array[] = {8,-11,4,6,-3,7,-5,2,-1,3};
cout<<"maxSubSum is : "<<maxSubSum(array, 10)<<endl;
double arrayB[] = {-3.0, 9.2, -5, 4.8, -9, 7.2};
cout<<"maxSubSum is : "<<maxSubSum(arrayB, 6)<<endl;
return 0;
}