剑指 Offer 42. 连续子数组的最大和

https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/

[wrong code]

class Solution {
    
    public int maxSubArray(int[] nums) {

        int n = nums.length;
        return d_c(0, n-1, nums);
    }

    int d_c(int l, int r, int[] nums){

        if(l>r){
            return Integer.MAX_VALUE;
        }
        if(l==r){
            return nums[l];
        }

        int mid = (l+r)/2;
        int sum=0, sum1, sum2;
        int csum = 0;
        int lsum=0, rsum=0;
        for(int i=mid;i>=l;i--){
            csum += nums[i];
            lsum = Math.max(lsum, csum);
        }
        csum = 0;
        for(int i=mid+1;i<=r;i++){
            csum += nums[i];
            rsum = Math.max(rsum, csum);
        }
        sum = lsum + rsum;

        sum1 = d_c(l, mid, nums);
        sum2 = d_c(mid+1, r, nums);

        return Math.max(sum, Math.max(sum1, sum2));
    }

}```