最大连续子序列和

给定一个数组，找出其最大连续子序列和
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
Maximum Subarray
动态规划，先找出局部最优解，再从局部最优解中找出全局最优解

int maxSubArray(vector<int>& nums) {    if (nums.empty())        return 0;    int local = nums[0];    int global = nums[0];;    for (int i = 1; i < nums.size(); ++i)    {        local = max(local + nums[i], nums[i]);        global = max(global, local);    }    return global;}