【剑指offer】题31：最大连续数组之和

---

int FindGreatestSumOfSubArray(vector<int> array){    assert(array.size()>0);    if(array.size()==1)    {return array[0];}    int my_max(array[0]);    for (auto i = 1; i < array.size();++i)    {        if (array[i-1]>0)        {            array[i] = array[i] + array[i - 1];        }        my_max = max(my_max, array[i]);    }    return my_max;}

---