Skip to content

Adding doctests in longest_sub_array.py #10194

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

Closed
AasheeshLikePanner wants to merge 2 commits into from
Closed

Adding doctests in longest_sub_array.py #10194

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b14de4e
Adding doctests in longest_sub_array.py
AasheeshLikePanner Oct 9, 2023
f04ed56
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Oct 9, 2023
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
15 changes: 15 additions & 0 deletions dynamic_programming/longest_sub_array.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,6 +16,21 @@ def __init__(self, arr):
self.array = arr.split(",")

def solve_sub_array(self):
"""
Solve the maximum subarray sum problem using dynamic programming.
Returns:
int: The maximum subarray sum.
Examples:
>>> subarray = SubArray("1, 2, 3, -2, 5")
>>> subarray.solve_sub_array()
9
>>> subarray = SubArray("-2, 1, -3, 4, -1, 2, 1, -5, 4")
>>> subarray.solve_sub_array()
6
>>> subarray = SubArray("1")
>>> subarray.solve_sub_array()
1
"""
rear = [int(self.array[0])] * len(self.array)
sum_value = [int(self.array[0])] * len(self.array)
for i in range(1, len(self.array)):
Expand Down