求最大子数组的两种算法
we want to find the nonempty, contiguous subarray of A whose values have the largest sum. We call this contiguous subarray the maximum subarray.Divide-and-Conquer solusion:FIND-MAXIMUM-SUBARRAY.A; low; high/1 if high == low2 return .low; high;AOElow/ // b
复制链接