Maximum Subarray

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
Input: nums = [1]
Output: 1
Input: nums = [5,4,-1,7,8]
Output: 23
var maxSubArray = function(nums) {
let sum = 0;
let maxSum = -Infinity;

if(nums.length === 0) return 0;
if(nums.length === 1) return nums[0]

for(let i = 0;i<nums.length;i++){
sum+=nums[i];
maxSum = Math.max(maxSum,sum);
if(sum < 0) sum = 0;
}
return maxSum;
};

--

--

--

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Mr Frontend weekly link sharing #45

Ionic Framework

Think With Modern and Advance JavaScript.

AJ Auntor ES6 Blog

Digital Signature — React Native

Implementing Routes with React Router DOM

Understanding Promise.race

Vue.js Components Communication Patterns (without Vuex) — Part 7

Office 365 web add-in

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
SunJet Liu

SunJet Liu

More from Medium

CS371p Spring 2022 Week 7: Mueed Ahmad

CS 373 Spring 2022: Saran Chockan

.hack//G.U. Last Recode Finally Released On Nintendo Switch

.hack//G.U. Last Recode Finally Released On Nintendo Switch

Challenges of Wireless Distributed Computing