Maximum Subarray

    这道题为简单题

  题目:

    

  思路:

    遍历列表,找到局部最优m和全局最优n

  代码:

 1 class Solution(object):
 2     def maxSubArray(self, nums):
 3         """
 4         :type nums: List[int]
 5         :rtype: int
 6         """
 7         n = m = float('-inf')
 8         for i in range(len(nums)):
 9             m = max(nums[i], m+nums[i])
10             n = max(n, m)
11         return n

 

posted @ 2017-09-21 23:44  唐僧洗发爱飘柔  阅读(94)  评论(0)    收藏  举报