题解 | 连续子数组的最大和(二)

#include <vector>
class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param array int整型vector
     * @return int整型vector
     */
    vector<int> FindGreatestSumOfSubArray(vector<int>& array) {

        vector<int> ans;
        int maxLeft, maxNum, maxSum = -1e9, curLeft = 0, curNum = 0, curSum = 0;


        for ( int i = 0; i < array.size(); i ++ ) {
            curSum += array[i];
            curNum ++;
            if ( curSum >= maxSum ) {  // 更新最大和
                maxSum = curSum;
                maxLeft = curLeft;
                maxNum = curNum;
            }
            if ( curSum < 0 ) { // 去除不可能的前缀
                curSum = 0;
                curNum = 0;
                curLeft = i + 1;
            }
        }

        for ( int i = 0; i < maxNum; i++ ) {
            ans.push_back(array[maxLeft + i]);
        }

        return ans;
    }
};