刷题六

求最大连续子序列和

#include <iostream>
#include <vector>
#include "math.h"
#include "limits.h"
using namespace std;

class Solution{
    public:
    int myMax(vector<int> & array){
        if(array.size() == 0)
            return 0;
        else{
            int preMax = array[0], maxSum = INT_MIN;
            for(int i = 1; i < array.size(); i ++){
                if(array[i] + preMax > array[i])
                    preMax = array[i] + preMax;
                else
                    preMax = array[i];
                maxSum = max(maxSum,preMax);
            }
            return maxSum;
        }
    }
};

int main() {
	cout  << "test\n";
	int arrayTemp[] = {1,2,3,4,-8,-5,2,4,20,-10};
	vector<int> array(arrayTemp, arrayTemp + 10);
	Solution sol;
	cout << sol.myMax(array) << endl;
	return 0;
}