leetcode :Find the contiguous subarray within an array (containing at least one number) which has th
题目:Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.整理后为:答案:intmaxProduct