【LeetCode with Python】 Maximum Subarray

最新推荐文章于 2026-02-09 06:23:36 发布

原创最新推荐文章于 2026-02-09 06:23:36 发布 · 1.3w 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#LeetCode #Python #LeetCode with Python

LeetCode with Python 同时被 2 个专栏收录

104 篇文章

订阅专栏

LeetCode with Python

104 篇文章

订阅专栏

介绍了一个经典的算法问题——寻找给定数组中具有最大和的连续子数组，并提供了一种线性时间复杂度的解决方案。

博客域名： http://www.xnerv.wang
原题页面： https://oj.leetcode.com/problems/maximum-subarray/
题目类型：
难度评价：★
本文地址： http://blog.csdn.net/nerv3x3/article/details/3465696

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray [4,−1,2,1] has the largest sum = 6.

click to show more practice.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

找最大和子数组，也是经典题目之一。

class Solution:

    # @param A, a list of integers
    # @return an integer
    def maxSubArray(self, A):

        len_A = len(A)
        if 1 == len_A:
            return A[0]

        max = None
        sum = 0
        for n in range(0, len_A):
            sum += A[n]
            if None == max or sum > max:
                max = sum
            if sum < 0:
                sum = 0
                continue

        return max