Skip to content

Update Maximum_Subset_Sum_With_No_Adjacent_Element.py #2

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.

Sign up for GitHub

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

Open
Yogessh3 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update Maximum_Subset_Sum_With_No_Adjacent_Element.py #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
2 changes: 1 addition & 1 deletion algoexpert.io/python/Maximum_Subset_Sum_With_No_Adjacent_Element.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ def max_subset_sum_with_no_adjacent(array):
max_sum = array[:] # copying the array into max_sum
max_sum[1] = max(array[0], array[1])
for i in range(2, len(array)):
max_sum[i] = max_sum(max_sum[i - 1], max_sum[i - 2] + array[i])
max_sum[i] = max(max_sum[i - 1], max_sum[i - 2] + array[i])
return max_sum[-1] # -1 refers to the last index

# Solution 2
Expand Down