{"size": 387, "ext": "js", "max_stars_repo_path": "javascript/53.maximum-subarray.js", "max_stars_repo_name": "Reddyman/Leetcode", "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "javascript/53.maximum-subarray.js", "max_issues_repo_name": "Reddyman/Leetcode", "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "javascript/53.maximum-subarray.js", "max_forks_repo_name": "Reddyman/Leetcode", "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null}
{"max_stars_count": null, "max_issues_count": null, "max_forks_count": null, "avg_line_length": 16.125, "max_line_length": 42, "alphanum_fraction": 0.5917312661}
/*
 * @lc app=leetcode id=53 lang=javascript
 *
 * [53] Maximum Subarray
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @return {number}
 */
var maxSubArray = function(nums) {
  let maxSum = nums[0]
  let currSum = 0
  for (let num of nums) {
    currSum += num
    if (currSum > maxSum) maxSum = currSum
    if (currSum < 0) currSum = 0
  }
  return maxSum
};
// @lc code=end

