GeezerVison is showing github.com — JavaScript/Dynamic-Programming/MaxNonAdjacentSum.js at master · TheAlgorithms/JavaScript

Expand file tree

MaxNonAdjacentSum.js

Copy path

More file actions

29 lines (22 loc) · 746 Bytes

Copy path

29 lines (22 loc) · 746 Bytes

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

function maximumNonAdjacentSum(nums) {

* Find the maximum non-adjacent sum of the integers in the nums input list

* :param nums: Array of Numbers

* :return: The maximum non-adjacent sum

if (nums.length < 0) return 0

let maxIncluding = nums[0]

let maxExcluding = 0

for (const num of nums.slice(1)) {

const temp = maxIncluding

maxIncluding = maxExcluding + num

maxExcluding = Math.max(temp, maxExcluding)

}

return Math.max(maxExcluding, maxIncluding)

}

// Example

// maximumNonAdjacentSum([1, 2, 3]))

// maximumNonAdjacentSum([1, 5, 3, 7, 2, 2, 6]))

// maximumNonAdjacentSum([-1, -5, -3, -7, -2, -2, -6]))

// maximumNonAdjacentSum([499, 500, -3, -7, -2, -2, -6]))

export { maximumNonAdjacentSum }