public int FindGreatestSumOfSubArray(int[] A) {
int n = A.length;
int[] dp = new int[n];
//dp[i] means the maximum subarray ending with A[i];
dp[0] = A[0];
int max = dp[0];
for(int i = 1; i < n; i++){
dp[i] = A[i] + (dp[i - 1] > 0 ? dp[i - 1] : 0);
max = Math.max(max, dp[i]);
}
//if (max < 0) return 0;
return max;
}
连续子数组的最大和 53. Maximum Subarray
最新推荐文章于 2021-07-28 13:11:13 发布