Problem 3/30 of LeetCode 30-day challenge (main solution from article, added comments for understanding)

maxSubArray.js

/**
 * Given at least one number
 * find the total from a 
 * contiguous set of numbers
 */
let maxSubArray = function(nums) {
  // setting to -infinity handles 
  // negative comparisons
	let max = -Infinity;
		temp = -Infinity;
  
  // array with one element case
  if(nums.length === 1) {
    return nums[0];
  }

	for(let i = 0; i < nums.length; i++) {
    // check for negative nums
    // resets to 0 if temp is negative
		temp = Math.max(0, temp);
    // add one num at a time
		temp += nums[i];
    // set max
		max = Math.max(max, temp);
	}
	return max;
};