leetcode刷题记录【动态规划类题目】—Python代码+详细注释

题目：剑指 Offer 42. 连续子数组的最大和
难度：简单
算法：动态规划

# 2022.04.20
class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        # base case
        dp = [0] * (len(nums) )
        dp[0] = nums[0]
        ans = nums[0]
        for i in range(1, len(nums) ):
            dp[i] = max(dp[i - 1] + nums[i], nums[i])
            ans = max(ans, dp[i])
        return ans