Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
参考阅读:
https://en.wikipedia.org/wiki/Maximum_subarray_problem
https://blog.csdn.net/joylnwang/article/details/6859677
int maxSubArray(int* nums, int numsSize) {
int sum = 0;
int max = INT_MIN;
for(int i = 0; i