题解 | #连续子数组的最大和#
连续子数组的最大和
http://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
#include using namespace std; class Solution { public: int FindGreatestSumOfSubArray(vector array) {
int left = 0;
int max = array[0] ;
for(int i = 0; i < array.size(); i++){
left += array[i];
if(left > max){
max = left;
}
if(left < 0){
left = 0;
}
}
return max;
}
};
投递百融云创等公司6个岗位