53. Maximum Subarray

Maximum Subarray

题意：给定一个数组 找出和最大的子序列
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 class Solution {    public int maxSubArray(int[] nums) {        int[] dp = new int[nums.length];        dp[0] = nums[0];        int max = nums[0];        for(int i = 1; i < nums.length; i++){            dp[i] = Math.max(dp[i-1] + nums[i], nums[i]);            max = Math.max(dp[i], max);        }        return max;    }}