连续子数组的最大和

class Solution {
public:
    int FindGreatestSumOfSubArray(vector<int> array) {
        if(array.size()==0)
            return 0;
        
        int nCurSum = 0;
        int nGreateSum = 0x80000000;
        for(vector<int>::size_type i = 0; i<array.size(); i++){
            if(nCurSum<=0)
                nCurSum = array[i];
            else
                nCurSum +=array[i];
            
            if(nCurSum > nGreateSum){
                nGreateSum = nCurSum;
            }
       
        }
        return nGreateSum;
    }
    
};