Maximum Subarray

</pre><pre name="code" class="cpp">int max(int a,int b)
{
return a>=b?a:b;
}
int maxSubArray(int* nums, int numsSize) {
int sum = nums[0] , maxSum = nums[0];
int i=0;
for(i = 1; i < numsSize; i++){
if(sum < 0) sum = 0;
sum += nums[i];
maxSum = max(maxSum, sum);
}
return maxSum;
}

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

.