Python习题——2018-05-02作业

Maximum Subarray

题目链接：LeetCode #53

题目描述

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

Example

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

思路

思路简单而巧妙：如果一个数组的子数组拥有最大局部和，那么其左边子数组的局部和一定小于等于0，右边子数组的局部和也一定小于等于0。初始化最大局部和变量max_result为数组最左侧元素，从左开始扫描数组，记录下当前的局部和，若大于max_result则取代之；若当前局部和小于0，就置其为0（相当于重置子数组的首元素位置），直到扫描完整个数组，返回max_result。时间复杂度为O(n)。

代码

class Solution:
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        max_result, tmp_result = nums[0], 0
        for num in nums:
            tmp_result += num
            max_result = max(max_result, tmp_result)
            tmp_result = max(tmp_result, 0)
        return max_result