Maximum Subarray(最大连续子串)

class Solution {
public:
    //动态规划，维护两个变量  local[i+1]=max(array[i],local[i]+array[i+1])
    int FindGreatestSumOfSubArray(vector<int> array) {
        int len=array.size();
        if(len==0) return 0;
        if(len==1) return array[0];
        int local=array[0];
        int global=array[0];
        for(int i=1;i<array.size();i++)
        {
            local=max(array[i],array[i]+local);//local>0?local+array[i]:array[i]
            global=max(local,global);
        }
        return global;
    }
};