leetcode53最大子序列和

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

class  {
public:
    int maxSubArray(vector<int>& nums) {
        int ans = 0, maxn = INT_MIN;
        int len = nums.size();
        for(int i = 0; i < len; i++){
            if(ans < 0) ans = 0;  
            ans += nums[i];
            maxn = max(maxn, ans);
        }
        return maxn;
    }
};
int main(){
    Solution s;
    int A[]={-2,1,-3,4,-1,2,1,-5,4};
    vector<int> B(A,A+9);
    cout<<s.maxSubArray(B);
}