Skip to content

Added maximum non-adjacent sum #2130

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Jun 17, 2020
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
33 changes: 33 additions & 0 deletions dynamic_programming/max_non_adjacent_sum.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
# Video Explaination: https://www.youtube.com/watch?v=6w60Zi1NtL8&feature=emb_logo

from typing import List


def maximum_non_adjacent_sum(nums: List[int]) -> int:
'''
Find the maximum non-adjacent sum of the integers in the nums input list

>>> print(maximum_non_adjacent_sum([1, 2, 3]))
4
>>> maximum_non_adjacent_sum([1, 5, 3, 7, 2, 2, 6])
18
>>> maximum_non_adjacent_sum([-1, -5, -3, -7, -2, -2, -6])
0
>>> maximum_non_adjacent_sum([499, 500, -3, -7, -2, -2, -6])
500
'''
if not nums:
return 0
max_including = nums[0]
max_excluding = 0
for num in nums[1:]:
max_including, max_excluding = (
max_excluding + num, max(max_including, max_excluding)
)
return max(max_excluding, max_including)


if __name__ == "__main__":
import doctest

doctest.testmod()