寻找最大的子串（分治法）

zevolo

于 2012-05-29 17:43:35 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： algorithm 文章标签： list file

本文链接：https://blog.csdn.net/zevolo/article/details/7613640

algorithm 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种使用分治法求解最大子数组和的问题，通过递归地找到跨越中点的最大子数组和以及左右两侧的最大子数组和，并比较得出最终结果。提供了完整的Python代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

O(nlgn)

#!/usr/bin/python

'''file name: maxsum.py
   --P71
   --find maximum subarray sum, divide-and-conquer O(nlng)
   --author: zevolo, 2012.05.11
'''

def find_max_across_mid(list, low, high, mid):
    ret = list[mid]
    right = mid
    sum = ret 
    for i in range(mid + 1, high + 1):
        sum = sum + list[i]
        if sum > ret:
            ret = sum 
            right = i 
    left = mid
    for i in range(mid - 1, low - 1, -1):
        sum = sum + list[i]
        if sum > ret:
            ret = sum
            left = i
    return left, right, ret
        
    
def find_max_sum(list, low, high):
    if high == low:
        return (low, high, list[low])
    
    mid = (low + high) / 2
    (l_low, l_high, l_sum) = find_max_sum(list, low, mid)
    (r_low, r_high, r_sum) = find_max_sum(list, mid + 1, high)
    (m_low, m_high, m_sum) = find_max_across_mid(list, low, high, mid)

    sum = max(l_sum, r_sum)
    sum = max(sum, m_sum)
    s_low = r_low
    s_high = r_high
    if sum == l_sum:
        s_low = l_low
        s_high = l_high
    elif sum == m_sum:
        s_low = m_low
        s_high = m_high
        
    return (s_low, s_high, sum)

if __name__ == '__main__':
    l = [1, -2, 3, 10, -4, 7, 2, -5]
    print l
    (low, high, sum) = find_max_sum(l, 0, len(l) - 1)
    out = l[low:high+1]
    print (out, sum)