mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
30 lines
746 B
JavaScript
30 lines
746 B
JavaScript
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 }
|