剑指offer——连续子数组的最大和

#include <vector>
#include <queue>
using namespace std;

class Solution {
    public:
        struct cmp{
            bool operator ()(int a,int b)const{
                return a<b; 
            }       
        };
        bool check(vector<int> array){
            bool flag = true;
            for(int i = 0 ; i < array.size() ; i++){
                if(array[i] >= 0){
                    flag = false;
                    break;
                }
            }
            return flag;
        }

        int FindGreatestSumOfSubArray(vector<int> array) {
            if(check(array) == true){
                priority_queue<int,vector<int>,cmp> q;
                for(int i = 0 ; i < array.size() ; i++){
                    q.push(array[i]);
                }
                return q.top();
            }
            int max = 0;
            int tmp = 0;
            for(int i = 0 ; i < array.size() ; i++){
                tmp += array[i];
                if(max < tmp){
                    max = tmp;
                }else if(tmp < 0){
                    tmp = 0;
                }
            }
            return max;
        }
};