Given an integer array nums, find a subarray that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. Note that the product ...
The test cases don't include the case of more than one only-zeros array. My code works for all the given test cases but fails the case when it's an array of more than one only-zeros e.g. [0, 0, 0].
Some results have been hidden because they may be inaccessible to you
Show inaccessible results