53.最大子序和.java

/*
 * @lc app=leetcode.cn id=53 lang=java
 *
 * [53] 最大子序和
 */

// @lc code=start
class Solution {
    public int maxSubArray(int[] nums) {
        if(nums == null || nums.length == 0){
            return 0;
        }
        int len = nums.length;
        int[] dp = new int[len];
        dp[0] = nums[0];
        int res = nums[0];
        for(int i=1;i<len;i++){
              dp[i] = Math.max(nums[i],dp[i-1]+nums[i]);
              res = Math.max(res,dp[i]);
        }
        return res;
     }
}
// @lc code=end