mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 17:06:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update max_sub_array.py (#1000)

Browse Source 
* Update max_sub_array.py

added another method of computing maximum sum subarray

* Update max_sub_array.py

* Update max_sub_array.py
This commit is contained in:
Sanders Lin 2019-07-18 00:12:24 +08:00 committed by cclauss
parent f195d9251c
commit f64b602938
1 changed files with 22 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
dynamic_programming/max_sub_array.py
View File

@ -2,7 +2,7 @@
author : Mayank Kumar Jha (mk9440) author : Mayank Kumar Jha (mk9440)
""" """
from __future__ import print_function from __future__ import print_function
from typing import List
import time import time
import matplotlib.pyplot as plt import matplotlib.pyplot as plt
from random import randint from random import randint
@ -37,7 +37,27 @@ def find_max_cross_sum(A,low,mid,high):
right_sum=summ right_sum=summ
max_right=i max_right=i
return max_left,max_right,(left_sum+right_sum) return max_left,max_right,(left_sum+right_sum)
def max_sub_array(nums: List[int]) -> int:
"""
Finds the contiguous subarray (can be empty array)
which has the largest sum and return its sum.
>>> max_sub_array([-2,1,-3,4,-1,2,1,-5,4])
6
>>> max_sub_array([])
0
>>> max_sub_array([-1,-2,-3])
0
"""
best = 0
current = 0
for i in nums:
current += i
if current < 0:
current = 0
best = max(best, current)
return best
if __name__=='__main__': if __name__=='__main__':
inputs=[10,100,1000,10000,50000,100000,200000,300000,400000,500000] inputs=[10,100,1000,10000,50000,100000,200000,300000,400000,500000]