53. Maximum Subarray #Medium

leetcode 53. Maximum Subarray #Medium

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.

题意：

求出数组的最大的连续子数组的和

分析：

动态规划求解，假设f(i)是以第i个数字A[i]结尾的子数组最大和，那么当f(i-1)<=0时，f(i)=A[i]；当f(i-1)>0时，f(i)=f(i-1)+A[i]。

C代码：

[code]int maxSubArray(int* nums, int numsSize) {
if(!nums || numsSize