算法刷题日记-乘积最大子数组

题目链接：https://leetcode-cn.com/problems/maximum-product-subarray/

/**
 * @param {number[]} nums
 * @return {number}
 */
var maxProduct = function(nums) {
 if(typeof nums == 'object' && nums instanceof Array){
          if(nums.length ==1){
            return nums[0]
          }else{
            let max = Math.max(...nums),currentResult = 1,allResult = [],startIndex = 0,endIndex = 0;
            for(let i = 0;i<nums.length-1;i++){
              currentResult = nums[i]
              for(let j = 1;j<nums.length;j++){
                if(i != j  && j>i){
                  currentResult = currentResult*nums[j]
                  if(currentResult>max){
                    max = currentResult;
                    startIndex = i;
                    endIndex = j
                  }
                  // console.log(currentResult,i,j)
                }
                
              }
            }
            
            return max
          }
        }else{
          return 0
        }
};