1. var maxProduct = (nums) => {
    2.   let res = nums[0]
    3.   let prevMin = nums[0]
    4.   let prevMax = nums[0]
    5.   let temp1 = 0, temp2 = 0
    6.   for (let i = 1; i < nums.length; i++) {
    7.     temp1 = prevMin * nums[i]
    8.     temp2 = prevMax * nums[i]
    9.     prevMin = Math.min(temp1, temp2, nums[i])
    10.     prevMax = Math.max(temp1, temp2, nums[i])
    11.     res = Math.max(prevMax, res)
    12.   }
    13.   return res
    14. }
    16. 作者：xiao_ben_zhu
    17. 链接：https://leetcode.cn/problems/maximum-product-subarray/solution/wa-ni-zhe-ti-jie-shi-xie-gei-bu-hui-dai-ma-de-nu-p/
    18. 来源：力扣（LeetCode）
    19. 著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。