题解 | #连续子数组的最大和#
连续子数组的最大和
http://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
动态规划算法C++
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int ret=array[0];
int n=array.size();
for(int i=1;i<n;i++)
{
if(array[i-1]>0)
{
array[i]+=array[i-1];
}
ret=max(ret, array[i]);
}
return ret;
}
};
