Topic36——53. Maximum subarray and

subject ： Give you an array of integers nums , Please find a continuous subarray with the largest sum （ A subarray contains at least one element ）, Return to its maximum and .
Subarray Is a continuous part of the array .

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

 Example  2：
 Input ：nums = [1]
 Output ：1

 Example  3：
 Input ：nums = [5,4,-1,7,8]
 Output ：23

Tips ：
1 <= nums.length <= 105
-104 <= nums[i] <= 104

Dynamic programming ：

class Solution {
    
    public int maxSubArray(int[] nums) {
    
        int max = nums[0];
        int pre = 0;
        for(int j = 0; j < nums.length; j++) {
    
            pre = Math.max(nums[j], nums[j] + pre);
            max = Math.max(max, pre);
        }
        return max;
    }
}