剑指offer 33 把数组排成最小的数

class Solution {
public:
    int FindGreatestSumOfSubArray(vector<int> array) {
        int length = array.size();
        if(length <= 0){
            invalid = true;
            return 0;
        }
        int sum = 0;
        int maxsum = 0x80000000;
        for(int i = 0;i < length;i++){
            if(sum < 0)
                sum = array[i];
        　　 sum += array[i];
            if(sum > maxsum)
                maxsum = sum;
        }
        return maxsum;
    }
    bool invalid = false;
};