同力扣53,下面是一个暴力解法
就是每次取出以i为首的最大子序列和,然后再i到n中取最大
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int whole_max = INT_MIN;
int sub_max = INT_MIN;
for(int i = 0;i<array.size();++i){
int sum = 0;
sum+=array[i];
sub_max = sum>sub_max?sum:sub_max;
for(int j = i+1;j<array.size();++j){
sum+=array[j];
sub_max = sum>sub_max?sum:sub_max;
}
whole_max = whole_max>sub_max?whole_max:sub_max;
}
return whole_max;
}
};