题解 | #连续子数组的最大和#

import java.util.Arrays; //全网最差代码 public class Solution { public int FindGreatestSumOfSubArray(int[] array) { int[] dp = new int[array.length]; findNum(array, 0, dp); int max = dp[0]; for(int i = 0;i < dp.length;i++) { if(max < dp[i]) max = dp[i]; }

	return max;
}
public void findNum(int[] array,int i,int[] dp) {
	if(i == array.length) return;
	
	if(i == 0) dp[i] = array[i];
	else {
		dp[i] = max(array[i],dp[i-1] + array[i]);
	}
	findNum(array, ++i, dp);
}

public int max(int a,int b) {
	return a>b?a:b;
}

}