LeetCode 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.

这是分治法的典型题目，首先把它分成两段，分的时候注意区间取为[x,y)，然后怎么把他们合起来呢，最后就要比较一下左右两边各自的大小和从中间开始往两边取的和中，三个数的最大值。

int MaxNumber(vector<int>& nums, int begin, int end){
    if(end-begin == 1)
    {
        return nums[begin];
    }
    int med = (end-begin)/2+begin;
    int maxleft=MaxNumber(nums, begin, med), maxright=MaxNumber(nums, med, end);
    int result = maxleft>maxright?maxleft:maxright;

    int sum = 0;int leftsum = nums[med-1];
    for(int i = med-1; i >= begin; i--)
    {
        sum += nums[i];
        if(leftsum < sum)
            leftsum = sum;
    }
    sum = 0; int rightsum = nums[med];
    for(int i = med; i < end; i++)
    {
        sum += nums[i];
        if(rightsum < sum)
            rightsum = sum;
    }

    return result>(leftsum+rightsum)?result:(leftsum+rightsum);
}


class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        return MaxNumber(nums, 0, nums.size());
    }
};