连续子数组的最大和

    int FindGreatestSumOfSubArray(vector<int> array) {
        if(array.empty())return 0;
        int prev = array[0], max_num = prev, cur;
        for(int i = 1;i < array.size();++i){
            cur = prev < 0 ? array[i] : prev + array[i];
            max_num = max(max_num, cur);
            prev = cur;
        }
        return max_num;
    }