leetcode 53: Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray [4,−1,2,1] has the largest sum = 6.

分治的还没细看

class Solution {
public:
    int maxSubArray(vector
   
   
    
    & nums) {
        if(nums.size()==0)
            return 0;
        int i=1;
        int j=nums.size();
        int leftMax=nums[0];
        int leftIndex=0;
        int numSum=nums[0];
        while(i