LeetCode-53-Maximum Subarray(最大和子串)

Q:

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.

Analysis:

题目较容易理解，求数组中最大和子串，返回和。
比较好想到用动态规划，dp[i]=max{sum[i],sum[i]+num[i+1]}

Code:

public class Solution {    public int maxSubArray(int[] nums) {        if(nums.length==0||nums==null){            return 0;        }        int max=nums[0];        int sum=nums[0];        for(int i=1;i<nums.length;i++){            sum=Math.max(nums[i], nums[i]+sum);            max=Math.max(max,sum);        }        return max;    }}