題目描述
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int len=array.size();
if(len<=0) return 0;
int curSum=0;
int maxSum=0x80000000;//非常小的值
for(int i=0;i<len;i++)
{
if(curSum<=0)
curSum=array[i];
else
curSum+=array[i];
if(curSum>maxSum)
maxSum=curSum;
}
return maxSum;
}
};
方法二、動態規劃法