leetcode-study/maximum-subarray/HerrineKim.js at main · JustHm/leetcode-study · GitHub

1 leetcode-study/maximum-subarray/HerrineKim.js at main · JustHm/leetcode-study · GitHub

18 lines (15 loc) · 369 Bytes

// 시간 복잡도 : O(n)
// 공간 복잡도 : O(1)
 * @param {number[]} nums
 * @return {number}
var maxSubArray = function(nums) {
  let currentSum = nums[0];
  let maxSum = nums[0];
  for (let i = 1; i < nums.length; i++) {
      currentSum = Math.max(nums[i], currentSum + nums[i]);
      maxSum = Math.max(maxSum, currentSum);
  return maxSum;