leetcode:Maximum Subarray

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

class Solution{
public:
    int maxSubArray(vector<int>& nums){
        //int n = nums.size();
        if(nums.empty()||!nums.size())
            return 0;
        int global = nums[0];
        int local = nums[0];
        for(int i=1;i<nums.size();i++){
            local=max(nums[i],local+nums[i]);
            global=max(global,local);
        }

        return global;
    }

};

int main(){
    vector<int> A= {-2,1,-3,4,-1,2,1,-5,4}; //c++11
    Solution s;
    cout<<s.maxSubArray(A)<<endl;

    return 0;
}