Leetcode interview question 16.17 Continuous sequence

Given an array of integers , Find the sequence with the largest sum , And return the sum .

Example ：

 Input ： [-2,1,-3,4,-1,2,1,-5,4]
 Output ： 6
 explain ：  Continuous subarray  [4,-1,2,1]  And the biggest , by  6.

Advanced ：

• If you have implemented complexity as O(n) Solution method , Try to use a more sophisticated divide and conquer method to solve .

Code:

class Solution {
    
public:
    int maxSubArray(vector<int>& nums) {
    
        int maxlen=nums[0];
        int sum=0;
        for(int i=0;i<nums.size();i++)
        {
    
            sum=max(nums[i]+sum,nums[i]);
            maxlen=max(sum,maxlen);
        }
        return maxlen;
    }
};