简单与不简单
连续子数组的最大和
http://www.nowcoder.com/questionTerminal/459bd355da1549fa8a49e350bf3df484
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int m = array[0];
int b = 0;
for(int i = 0;i < array.size();i++)
{
if(b < 0) b = array[i];
else b += array[i];
m = max(m,b);
}
return m;
}
};
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int m = array[0];
int b = 0;
for(int i = 0;i < array.size();i++)
{
if(b < 0) b = array[i];
else b += array[i];
m = max(m,b);
}
return m;
}
};
