今日营业：每日一题

今天应该开始这一题了，题目如下：





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.

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.

# @File    : maximum_subarray.py
# @Date    : 2020-02-08
# @Author  : shengjia

def maxSubArray(nums):
    for i in range(1, len(nums)):
        if nums[i - 1] > 0:
            nums[i] += nums[i - 1]
    print(max(nums))
    return max(nums)


inputs = [-2, 1, -3, 4, -1, 2, 5, -5, 4]
maxSubArray(inputs)