题解 | #连续子数组的最大和#
连续子数组的最大和
http://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int inf=-0x3f3f3f3f;
int sum=0;
for(int i=0;i<array.size();i++){
sum=max(array[i],array[i]+sum);//较大更新
inf=max(inf,sum);
}
return inf;
}
};
