您的位置:首页 > 其它

LintCode: 最小子数组

2016-09-08 00:28 274 查看
LintCode: 最小子数组

class Solution:
"""
@param nums: a list of integers
@return: A integer denote the sum of minimum subarray
"""
def minSubArray(self, nums):
# write your code here
if not nums:
return
n = len(nums)
dp = [0 for i in range(n)]
dp[0] = nums[0]
ans = nums[0]
for i in range(1, n):
dp[i] = min(dp[i-1] + nums[i], nums[i])
ans = min(ans, dp[i])
return ans
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: