OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2023-10-09 16:58:50 +00:00
parent b14de4e470
commit f04ed5674e
1 changed files with 13 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
dynamic_programming/longest_sub_array.py
View File

@ -17,19 +17,19 @@ class SubArray:
def solve_sub_array(self): def solve_sub_array(self):
""" """
Solve the maximum subarray sum problem using dynamic programming. Solve the maximum subarray sum problem using dynamic programming.
Returns: Returns:
int: The maximum subarray sum. int: The maximum subarray sum.
Examples: Examples:
>>> subarray = SubArray("1, 2, 3, -2, 5") >>> subarray = SubArray("1, 2, 3, -2, 5")
>>> subarray.solve_sub_array() >>> subarray.solve_sub_array()
9 9
>>> subarray = SubArray("-2, 1, -3, 4, -1, 2, 1, -5, 4") >>> subarray = SubArray("-2, 1, -3, 4, -1, 2, 1, -5, 4")
>>> subarray.solve_sub_array() >>> subarray.solve_sub_array()
6 6
>>> subarray = SubArray("1") >>> subarray = SubArray("1")
>>> subarray.solve_sub_array() >>> subarray.solve_sub_array()
1 1
""" """
rear = [int(self.array[0])] * len(self.array) rear = [int(self.array[0])] * len(self.array)
sum_value = [int(self.array[0])] * len(self.array) sum_value = [int(self.array[0])] * len(self.array)