代码挑战: 最大子数组 #Python3
【摘要】 Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explanation: ...
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.方案：
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
result= nums[0]
temp = nums[0]
size = len(nums)
for i in range(1, size):
temp = max(temp + nums[i], nums[i])
result = max(temp, result)
return result
测试案例：
def test_maxSubArray1(self):
s = Solution()
a = [-2, -3, 4, -1, -2, 1, 5, -3]
self.assertEqual(s.maxSubArray(a), 7 )
def test_maxSubArray2(self):
s = Solution()
a = [-2,1,-3,4,-1,2,1,-5,4]
self.assertEqual(s.maxSubArray(a), 6 )
def test_maxSubArray3(self):
s = Solution()
a = [-2]
self.assertEqual(s.maxSubArray(a), -2 )
【声明】本内容来自华为云开发者社区博主，不代表华为云及华为云开发者社区的观点和立场。转载时必须标注文章的来源（华为云社区）、文章链接、文章作者等基本信息，否则作者和本社区有权追究责任。如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
作者其他文章
评论（0）