# # max sum of the subarray # @param arr int整型一维数组 the array # @return int整型 # class Solution: def maxsumofSubarray(self , arr ): # write code here max = 0 i = 0 size = len(arr) sum = 0 while (i < size): sum += arr[i] i += 1 if sum <= 0: sum = 0 continue if sum > max: max = sum return max