[LeetCode] Maximun Subarray

求连续的子数组中和的最大值。原文链接：Maximum Subarray

思路：动态规划求出每一个点上的子数组的和的最大值，最后遍历 dp 数组求出最大值即为答案，状态转移方程为：dp[i] = max(dp[i - 1] + nums[i], nums[i]) ; 

public class Solution {    public int maxSubArray(int[] nums) {        if(nums.length == 0) {</span>return 0;}int[] dp = new int[nums.length] ;dp[0] = nums[0] ;for(int i = 1; i < nums.length; i ++){dp[i] = Math.max(dp[i - 1] + nums[i], nums[i]) ;}int Max = -9999 ;for(int i = 0; i < dp.length; i ++) {if(dp[i] > Max) {Max = dp[i] ;}}return Max ;    }}