连续子数组的最大和

class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int n = array.size();
if(0 == n)
return 0;</int>

    int temp =array[0];
    int max = temp;
    for(int i = 1; i<n; i++)
    {
        if(temp > 0)
            temp = temp + array[i];
        else
            temp = array[i];

        max = max > temp ? max:temp;
    }
    return max;
}

};