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

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param array int整型vector 
     * @return int整型vector
     */
vector<int> FindGreatestSumOfSubArray(vector<int>& array) {
        // write code here
        int max=-100,sum=0,left=0,right=0,temp=0;
        for(int i=0;i<array.size();i++)
        {
            if(sum<0)
            {
                sum = array[i];
                if(max<=sum||max>0)
                    temp = i;
            }
            else
            {
                sum += array[i];
            }
            if(max<=sum)
            {
                max = sum;
                left = temp;
                right = i;
            }
        }
            
        return vector<int>(array.begin()+left,array.begin()+right+1);
    }
};