Max subarray product
-
05-11-2019 - |
문제
Is it possible to solve the max sub-array product problem using divide and conquer?
Given an integer array numbers, find the contiguous sub-array within an array (containing at least one number) which has the largest product.
Example 1:
Input: [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
올바른 솔루션이 없습니다
제휴하지 않습니다 cs.stackexchange