Niuke Tiba-Algorithm NC19 Sub-array Maximum Accumulation Problem

Code:

class Solution:
    def maxsumofSubarray(self , arr ):
        temp = 0
        resmax = arr[0]
        for num in arr:
            temp = max(temp+num, num)
            resmax = max(temp, resmax)
        return resmax

 

Guess you like

Origin blog.csdn.net/xq66660821/article/details/115312700