Leetcode 152. product maximum subarray (brute force cracking can actually pass!)

Give you an array of integers nums , Please find the non empty continuous subarray with the largest product in the array （ The subarray contains at least one number ）, And returns the product of the subarray .

The answer to the test case is 32- position Integers .

Subarray Is a continuous subsequence of an array .

Example 1:

 Input : nums = [2,3,-2,4]
 Output : 6
 explain :  Subarray  [2