Maximum Product Subarray

1. Title

Maximum Product Subarray

2. Http address

https://leetcode.com/problems/maximum-product-subarray/

3. The question

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest product = 6.

4 My code(AC)

•        // Accepted
    public static int maxProductTwo(int[] nums) {
          
              int res_opt = nums[0];
              int tmp = 0;
              int max_bf,max_cur;
              int min_bf,min_cur;
              max_bf = nums[0];
              min_bf = nums[0];
              for(int i = 1; i < nums.length; i++){
                  
                  max_cur = Math.max(max_bf * nums[i], nums[i]);
                  max_cur = Math.max(min_bf * nums[i], max_cur);
                  min_cur = Math.min(max_bf * nums[i], nums[i]);
                  min_cur = Math.min(min_bf * nums[i], min_cur);
                  
                  
                  tmp = Math.max(min_bf*nums[i], max_bf*nums[i]);
                  res_opt = Math.max(res_opt, tmp);
                  res_opt = Math.max(res_opt, nums[i]);
                  
                  max_bf = max_cur;
                  min_bf = min_cur;
              }
              
             return res_opt;
         }