第四周：53. Maximum Subarray

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.

Subscribe to see which companies asked this question.

代码：

int maxSubArray(int* nums, int numsSize) {int ans=nums[0],i,j,sum=0;for(i=0;i<numsSize;i++){    sum+=nums[i];if(ans<sum)ans=sum;if(sum<0)sum=0;        }        return ans;}