连续子数组的最大和

class Solution {
public:
	int FindGreatestSumOfSubArray(vector<int> array) {
		if(array.size() == 0)
            return 0;
        int num = 0;
        int max = INT_MIN;
        for(int i = 0; i < array.size(); i++){
            num += array[i];
            if(num > max)
                max = num;
            if(num < 0)
                num = 0;
        }
        return max;
            
	}
};