offer 42. 连续子数组的最大和

#!/usr/bin/env python
# -*- coding:utf-8 -*-
# author:wu_tianDe
# datetime:2021/7/17 8:14
# software: PyCharmclass Solution:def maxSubArray(self, nums:list) -> int:length = len(nums)if length==1:print("只有一个数")return nums[0]maxsum,cursum = nums[0],0for i in range(0,length):cursum +=nums[i]if cursum > maxsum:maxsum = cursumif cursum < 0:cursum = 0return maxsumif __name__ == '__main__':s = Solution()ans = s.maxSubArray([1,2,-7,3])print(ans)