53.Maximum Subarray

53.Maximum Subarray

• 题目描述：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.

• 题目大意：找出一个连续子数组，使其有最大的和。

• 思路：dp,dp[i]=Math.max(dp[i-1]+nums[i],nums[i])，dp[i] 为以i结尾的最大的连续子序列的和

• 代码

  package Array;import java.util.ArrayList;import java.util.HashMap;import java.util.List;import java.util.Map;public class Solution {    public int maxSubArray(int[] nums) {        if (nums == null || nums.length == 0) {            return 0;        }        int n = nums.length;        int[] dp = new int[n];        dp[0] = nums[0];        int max = dp[0];        for(int i=1;i<n;i++) {            dp[i] = nums[i] + (dp[i - 1] > 0 ? dp[i - 1] : 0);            max = Math.max(dp[i], max);        }        return max;    }}

  ​