LeetCode力扣 53. 最大子序和 Maximum Subarray 题解代码 JavaScript

​​https://leetcode-cn.com/problems/maximum-subarray/​​

/**
 * @param {number[]} nums
 * @return {number}
 */
var maxSubArray = function(nums) {
    var mV = nums[0];
    var i,j,k = nums[0];
    for(i=1;i<nums.length;++i) {
        if(k < 0)
            k = nums[i];
        else
            k += nums[i];
        if(k > mV)
            mV = k;
    }
    return mV;
};