LeetCode-Easy刷题(11) Maximum Subarray

Posted 2022-05-31 当以乐

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.

求连续子串和的最大值.

 //动态规划
    public static int maxSubArray(int[] nums) 
        if(nums==null || nums.length<1)
            return 0;
        
        int local = nums[0];
        int global = nums[0];
        for (int i = 1; i < nums.length; i++) 
             local = Math.max(nums[i], local + nums[i]);//局部最优解
             global = Math.max(local, global);//全局最优解
        
        return global;