1class Solution {2    public int maxProduct(int[] nums) {3        int maxEnd = nums[0], minEnd = nums[0], best = nums[0];4        for (int i = 1; i < nums.length; i++) {5            int a = maxEnd * nums[i], b = minEnd * nums[i];6            maxEnd = Math.max(nums[i], Math.max(a, b));7            minEnd = Math.min(nums[i], Math.min(a, b));8            best = Math.max(best, maxEnd);9        }10        return best;11    }12}