leetcode 53. Maximum Subarray python
2018-04-06 21:14
357 查看
在数组中找到连续的子数组（至少包含一个数字）要求这个数组的总和最大。
例如，给定数组[-2,1，-3,4，-1,2,1，-5,4]，
连续的子阵列[4，-1,2,1]具有最大的总和= 6。
即最大子序列和问题class Solution(object):
def maxSubArray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
thissum = 0
maxsum = -10000000000000
for i in range(0,len(nums)):
if thissum < 0:
thissum = 0
thissum = thissum + nums[i]
maxsum = max(thissum,maxsum)
return maxsum
例如，给定数组[-2,1，-3,4，-1,2,1，-5,4]，
连续的子阵列[4，-1,2,1]具有最大的总和= 6。
即最大子序列和问题class Solution(object):
def maxSubArray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
thissum = 0
maxsum = -10000000000000
for i in range(0,len(nums)):
if thissum < 0:
thissum = 0
thissum = thissum + nums[i]
maxsum = max(thissum,maxsum)
return maxsum
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode By Python]53. Maximum Subarray
- LeetCode53. Maximum Subarray-python(easy) DP思想
- [leetcode]53. Maximum Subarray 最大连续子串python实现【medium】
- [leetcode]53. Maximum Subarray 最大连续子串python实现【medium】
- leetcode-53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- Leetcode 53. Maximum Subarray
- LeetCode:53. Maximum Subarray
- LeetCode 53. Maximum Subarray 题解
- leetcode 53. Maximum Subarray 动态规划DP + 最大子串和
- leetcode--53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- 【leetcode】53. Maximum Subarray
- LeetCode *** 53. Maximum Subarray
- 【LeetCode】53. Maximum Subarray
- [leetcode]: 53. Maximum Subarray
- [leetcode]#53. Maximum Subarray
- leetcode--53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- leetcode题解-53. Maximum Subarray && 448. Find All Numbers Disappeared in an Array