1.输入一个数组,返回其最大连续子数组的和,数组中正负整数都有
class Solution:
def findsum(self, array):
maxnum = None
tempnum = 0
for i in array:
if maxnum == None:
maxnum = i
if tempnum + i < i:
tempnum = i
else:
tempnum += i
if maxnum < tempnum:
maxnum = tempnum
return maxnum